Atsushi Kaneko

Shinya Fujita, Atsushi Kaneko, Ingo Schiermeyer, Kazuhiro Suzuki: A Rainbow k-Matching in the Complete Graph with r Colors. Electr. J. Comb. 16(1) (2009)

Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Contractible edges in minimally k-connected graphs. Discrete Mathematics 308(4): 597-602 (2008)

Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki: Spanning trees with leaf distance at least four. Journal of Graph Theory 55(1): 83-90 (2007)

Atsushi Kaneko, Kazuhiro Suzuki: Packing two copies of a tree into its third power. Discrete Mathematics 306(21): 2779-2785 (2006)

Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Vertices of Degree 5 in a Contraction Critically 5-connected Graph. Graphs and Combinatorics 21(1): 27-37 (2005)

Atsushi Kaneko, Mikio Kano: Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests. Int. J. Comput. Geometry Appl. 15(3): 229-238 (2005)

Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki: Partitioning complete multipartite graphs by monochromatic trees. Journal of Graph Theory 48(2): 133-141 (2005)

Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei: Long cycles in triangle-free graphs with prescribed independence number and connectivity. J. Comb. Theory, Ser. B 91(1): 43-55 (2004)

Kiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito: Cycles having the same modularity and removable edges in 2-connected graphs. Discrete Mathematics 265(1-3): 23-30 (2003)

Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Vertices of degree 6 in a contraction critically 6-connected graph. Discrete Mathematics 273(1-3): 55-69 (2003)

Atsushi Kaneko: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. J. Comb. Theory, Ser. B 88(2): 195-218 (2003)

Atsushi Kaneko, Kiyoshi Yoshimoto: A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. Journal of Graph Theory 43(4): 269-279 (2003)

Atsushi Kaneko, Mikio Kano: A Balanced Interval of Two Sets of Points on a Line. IJCCGGT 2003: 108-112

Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto: Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64: 239- (2002)

Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda: Path factors in claw-free graphs. Discrete Mathematics 243(1-3): 195-200 (2002)

Atsushi Kaneko, Kiyoshi Yoshimoto: On a 2-factor with a specified edge in a graph satisfying the Ore condition. Discrete Mathematics 257(2-3): 445-461 (2002)

Atsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto: On a hamiltonian cycle in which specified vertices are not isolated. Discrete Mathematics 258(1-3): 85-91 (2002)

Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto: On geometric independency trees for points in the plane. Discrete Mathematics 258(1-3): 93-104 (2002)

Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Contractible edges in minimally k-connected graphs. Electronic Notes in Discrete Mathematics 11: 20-29 (2002)

Atsushi Kaneko: Spanning trees with constraints on the leaf degree. Discrete Applied Mathematics 115(1-3): 73-76 (2001)

Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi: Vertices of degree 6 in a 6-contraction critical graph. Electronic Notes in Discrete Mathematics 10: 2-6 (2001)

Atsushi Kaneko, Kiyoshi Yoshimoto: On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed. J. Comb. Theory, Ser. B 81(1): 100-109 (2001)

Atsushi Kaneko, Alexander K. Kelmans, Tsuyoshi Nishimura: On packing 3-vertex paths in a graph. Journal of Graph Theory 36(4): 175-197 (2001)

Atsushi Kaneko, Mikio Kano: Straight line embeddings of rooted star forests in the plane. Discrete Applied Mathematics 101(1-3): 167-175 (2000)

Atsushi Kaneko, Kiyoshi Yoshimoto: A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. Electronic Notes in Discrete Mathematics 5: 198-200 (2000)

Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto: Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. Int. J. Comput. Geometry Appl. 10(1): 73-78 (2000)

Atsushi Kaneko, Kiyoshi Yoshimoto: On spanning trees with restricted degrees. Inf. Process. Lett. 73(5-6): 163-165 (2000)

Atsushi Kaneko, Katsuhiro Ota: On Minimally (n, )-Connected Graphs. J. Comb. Theory, Ser. B 80(1): 156-171 (2000)

Atsushi Kaneko, Mikio Kano: Generalized Balanced Partitions of Two Sets of Points in the Plane. JCDCG 2000: 176-186

Atsushi Kaneko, Mikio Kano: On Paths in a Complete Bipartite Geometric Graph. JCDCG 2000: 187-191

Atsushi Kaneko, Mikio Kano: Balanced partitions of two sets of points in the plane. Comput. Geom. 13(4): 253-261 (1999)

Atsushi Kaneko, Mikio Kano: Straight-Line Embeddings of Two Rooted Trees in the Plane. Discrete & Computational Geometry 21(4): 603-613 (1999)

Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura: A degree condition for the existence of 1-factors in graphs or their complements. Discrete Mathematics 203(1-3): 1-8 (1999)

Atsushi Kaneko, Hiroshi Maehara, Mamoru Watanabe: On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph. J. Comb. Theory, Ser. B 75(1): 110-115 (1999)

Atsushi Kaneko, Kiyoshi Yoshimoto: The Connectivities of Leaf Graphs of 2-Connected Graphs. J. Comb. Theory, Ser. B 76(2): 155-169 (1999)

Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto: Some results on geometric independency trees. CCCG 1999

Atsushi Kaneko, Mamoru Watanabe: String Decompositions of Graphs. Ars Comb. 49 (1998)

Atsushi Kaneko: On decomposition of triangle-free graphs under degree constraints. Journal of Graph Theory 27(1): 7-9 (1998)

Atsushi Kaneko, Mikio Kano: Balanced partitions of two sets of points in the plane. CCCG 1998

Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga: Straight-line embeddings of three rooted trees in the plane. CCCG 1998

Jin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Nakamura, Eduardo Rivera-Campo, Shin-ichi Tokunaga, Jorge Urrutia: Radial Perfect Partitions of Convex Sets in the Plane. JCDCG 1998: 1-13

Atsushi Kaneko: On the Maximum Degree of Bipartite Embeddings of Trees in the Plane. JCDCG 1998: 166-171

Atsushi Kaneko: A balanced partition of points in the plane and tree embedding problems. CCCG 1997

Kiyoshi Ando, Atsushi Kaneko: A remark on the connectivity of the complement of a 3-connected graph. Discrete Mathematics 151(1-3): 39-47 (1996)

Hikoe Enomoto, Jan van den Heuvel, Atsushi Kaneko, Akira Saito: Relative length of long paths and cycles in graphs with large degree sums. Journal of Graph Theory 20(2): 213-225 (1995)

Hikoe Enomoto, Atsushi Kaneko, Mekkia Kouider, Zsolt Tuza: Degree Sums and Covering Cycles. Journal of Graph Theory 20(4): 419-422 (1995)

Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto: A mixed version of Menger's theorem. Combinatorica 11(1): 71-74 (1991)

Atsushi Kaneko, Akira Saito: Cycles intersecting a prescribed vertex set. Journal of Graph Theory 15(6): 655-664 (1991)

Atsushi Kaneko: Paths and cycles concerning independent edges. Graphs and Combinatorics 6(4): 339-363 (1990)