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

Atsushi Kaneko · Journal of Combinatorial Theory Series B · 2003 · 115 citations

Natural Sciences, Geography, Combinatorics +3

Path factors in claw-free graphs

Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko et al. · Discrete Mathematics · 2002 · 39 citations

Natural Sciences, Mathematics, Combinatorics +4

On decomposition of triangle-free graphs under degree constraints

Atsushi Kaneko · Journal of Graph Theory · 1998 · 38 citations

Natural Sciences, Computer Science, Mathematics +13

On packing 3-vertex paths in a graph

Atsushi Kaneko, Alexander Kelmans, Tsuyoshi Nishimura · Journal of Graph Theory · 2001 · 35 citations

Natural Sciences, Computer Science, Mathematics +10

Relative length of long paths and cycles in graphs with large degree sums

Hikoe Enomoto, Jan van den Heuvel, Atsushi Kaneko et al. · Journal of Graph Theory · 1995 · 34 citations

Natural Sciences, Computer Science, Mathematics +9