Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kaneko, Atsushi"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Spanning trees with leaf distance at least four
Atsushi Kaneko
,
M. Kano
,
Kazuhiro Suzuki
Journal of Graph Theory
55
(1), 2007, pp. 83-90
Vertices of degree 5 in a contraction critically 5-connected graph
Kiyoshi Ando
,
Atsushi Kaneko
,
Ken-ichi Kawarabayashi
Graphs and Combinatorics
21
(1), 2005, pp. 27-37
Partitioning complete multipartite graphs by monochromatic trees
Atsushi Kaneko
,
M. Kano
,
Kazuhiro Suzuki
Journal of Graph Theory
48
(2), 2005, pp. 133-141
Long cycles in triangle-free graphs with prescribed independence number and connectivity
Hikoe Enomoto
,
Atsushi Kaneko
,
Akira Saito
,
Bing Wei
Journal of Combinatorial Theory Series B
91
(1), 2004, pp. 43-55
A 2-factor with two components of a graph satisfying the Chvátal-Erd\Hos condition
Atsushi Kaneko
,
Kiyoshi Yoshimoto
Journal of Graph Theory
43
(4), 2003, pp. 269-279
A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
Atsushi Kaneko
Journal of Combinatorial Theory Series B
88
(2), 2003, pp. 195-218
On packing 3-vertex paths in a graph
Atsushi Kaneko
,
Alexander Kelmans
,
Tsuyoshi Nishimura
Journal of Graph Theory
36
(4), 2001, pp. 175-197
On a Hamiltonian cycle in which specified vertices are uniformly distributed
Atsushi Kaneko
,
Kiyoshi Yoshimoto
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 100-109
Spanning trees with constraints on the leaf degree
Atsushi Kaneko
Discrete Applied Mathematics
115
(1-3), 2001, pp. 73-76
Straight line embeddings of rooted star forests in the plane
Atsushi Kaneko
,
M. Kano
Discrete Applied Mathematics
101
(1-3), 2000, pp. 167-175
On minimally
(n,\lambda)
-connected graphs
Atsushi Kaneko
,
Katsuhiro Ota
Journal of Combinatorial Theory Series B
80
(1), 2000, pp. 156-171
On spanning trees with restricted degrees
Atsushi Kaneko
,
Kiyoshi Yoshimoto
Information Processing Letters
73
(5-6), 2000, pp. 163-165
On the number of acute triangles in a straight-line embedding of a maximal planar graph
Atsushi Kaneko
,
Hiroshi Maehara
,
Mamoru Watanabe
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 110-115
The connectivities of leaf graphs of 2-connected graphs
Atsushi Kaneko
,
Kiyoshi Yoshimoto
Journal of Combinatorial Theory Series B
76
(2), 1999, pp. 155-169
On decomposition of triangle-free graphs under degree constraints
Atsushi Kaneko
Journal of Graph Theory
27
(1), 1998, pp. 7-9
Relative length of long paths and cycles in graphs with large degree sums
Hikoe Enomoto
,
Jan van den Heuvel
,
Atsushi Kaneko
,
Akira Saito
Journal of Graph Theory
20
(2), 1995, pp. 213-225
Degree sums and covering cycles
Hikoe Enomoto
,
Atsushi Kaneko
,
Mekkia Kouider
,
Zsolt Tuza
Journal of Graph Theory
20
(4), 1995, pp. 419-422
A mixed version of Menger's theorem
Yoshimi Egawa
,
Atsushi Kaneko
,
Makoto Matsumoto
Combinatorica
11
, 1991, pp. 71-74
Cycles intersecting a prescribed vertex set
Atsushi Kaneko
,
Akira Saito
Journal of Graph Theory
15
(6), 1991, pp. 655-664
Paths and cycles concerning independent edges
Atsushi Kaneko
Graphs and Combinatorics
6
, 1990, pp. 339-363