Factors and factorizations of graphs—a survey J Akiyama, M Kano Journal of Graph Theory 9 (1), 1-42, 1985 | 190 | 1985 |
Factors and factorizations of graphs: Proof techniques in factor theory J Akiyama, M Kano Springer Science & Business Media, 2011 | 188 | 2011 |
Monochromatic and heterochromatic subgraphs in edge-colored graphs-a survey M Kano, X Li Graphs and Combinatorics 24 (4), 237-263, 2008 | 158 | 2008 |
Discrete geometry on red and blue points in the plane—a survey— A Kaneko, M Kano Discrete and Computational Geometry: The Goodman-Pollack Festschrift, 551-570, 2003 | 147 | 2003 |
On factors with given components A Amahashi, M Kano Discrete Mathematics 42 (1), 1-6, 1982 | 88 | 1982 |
Packing paths of length at least two M Kano, GY Katona, Z Király Discrete mathematics 283 (1-3), 129-135, 2004 | 72 | 2004 |
Compatible geometric matchings O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ... Computational Geometry 42 (6-7), 617-626, 2009 | 67 | 2009 |
Path factors of a graph J Akiyama, M Kano Graph theory and its Applications, 11-22, 1984 | 63 | 1984 |
Balanced partitions of two sets of points in the plane A Kaneko, M Kano Computational Geometry 13 (4), 253-261, 1999 | 58 | 1999 |
Some results on odd factors of graphs C Yuting, M Kano Journal of graph theory 12 (3), 327-333, 1988 | 51 | 1988 |
Component factors with large components in graphs M Kano, H Lu, Q Yu Applied Mathematics Letters 23 (4), 385-389, 2010 | 47 | 2010 |
Spanning trees with a bounded number of leaves in a claw-free graph. M Kano, A Kyaw, H Matsuda, K Ozeki, A Saito, T Yamashita Ars Comb. 103, 137-154, 2012 | 39 | 2012 |
Path and cycle factors of cubic bipartite graphs M Kano, C Lee, K Suzuki Discussiones Mathematicae Graph Theory 28 (3), 551-556, 2008 | 39 | 2008 |
Binding numbers and f-factors of graphs M Kano, N Tokushige Journal of Combinatorial Theory, Series B 54 (2), 213-221, 1992 | 36 | 1992 |
Alternating Hamilton cycles with minimum number of crossings in the plane A Kaneko, M Kano, K Yoshimoto International Journal of Computational Geometry & Applications 10 (01), 73-78, 2000 | 35 | 2000 |
Radial perfect partitions of convex sets in the plane J Akiyama, A Kaneko, M Kano, G Nakamura, E Rivera-Campo, ... Japanese Conference on Discrete and Computational Geometry, 1-13, 1998 | 33 | 1998 |
Three edge disjoint multicolored spanning trees in complete graphs A Kaneko, M Kano, K Suzuki preprint, 2003 | 32 | 2003 |
Path coverings of two sets of points in the plane A Kaneko, M Kano, K Suzuki Contemporary Mathematics 342, 99-112, 2004 | 31 | 2004 |
A sufficient condition for a graph to have [a, b]-factors. M Kano Graphs Comb. 6 (3), 245-251, 1990 | 31 | 1990 |
Maximum andk-th maximal spanning trees of a weighted graph M Kano Combinatorica 7 (2), 205-214, 1987 | 29 | 1987 |