Mikio Kano

According to our database, Mikio Kano authored at least 111 papers between 1982 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Sufficient conditions for edge-colored bipartite graphs to have rainbow and properly colored spanning trees.

Shinya Fujita, Mikio Kano, Shun-ichi Maezawa, Masao Tsugaki, Kiyoshi Yoshimoto

Discret. Math., 2026

Factors of bipartite graphs with degree conditions imposed on each partite set.

Michitaka Furuya, Mikio Kano

Discret. Appl. Math., 2026

2025

Spanning Path-Cycle Systems with Given End-Vertices in Regular Graphs.

Yoshimi Egawa, Mikio Kano, Kenta Ozeki

Graphs Comb., December, 2025

Odd-Even Factors of Graphs.

Mikio Kano, Hajime Matsumura

Graphs Comb., June, 2025

2024

Degree Factors with Red-Blue Coloring of Regular Graphs.

Michitaka Furuya, Mikio Kano

Electron. J. Comb., 2024

2023

Factors with Red-Blue Coloring of Claw-Free Graphs and Cubic Graphs.

Michitaka Furuya, Mikio Kano

Graphs Comb., August, 2023

2022

Factors of bi-regular bipartite graphs.

Yoshimi Egawa, Michitaka Furuya, Mikio Kano

Discret. Appl. Math., 2022

2021

Discrete Geometry on Colored Point Sets in the Plane - A Survey.

Mikio Kano, Jorge Urrutia

Graphs Comb., 2021

Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs.

Mikio Kano, Masao Tsugaki

Graphs Comb., 2021

Rainbow polygons for colored point sets in the plane.

David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber

Discret. Math., 2021

2020

Strong Tutte type conditions and factors of graphs.

Mikio Kano, Zheng Yan

Discuss. Math. Graph Theory, 2020

Characterization of 1-tough graphs using factors.

Hongliang Lu, Mikio Kano

Discret. Math., 2020

Color degree sum conditions for properly colored spanning trees in edge-colored graphs.

Mikio Kano, Shun-ichi Maezawa, Katsuhiro Ota, Masao Tsugaki, Takamasa Yashima

Discret. Math., 2020

Properly colored spanning trees in edge-colored graphs.

Yangyang Cheng, Mikio Kano, Guanghui Wang

Discret. Math., 2020

Existence of all generalized fractional (g, f)-factors of graphs.

Yoshimi Egawa, Mikio Kano, Maho Yokota

Discret. Appl. Math., 2020

Spanning trees with small diameters.

Mikio Kano, Hajime Matsumura

AKCE Int. J. Graphs Comb., 2020

2019

K_1,3-covering red and blue points in the plane.

Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel

Discret. Math. Theor. Comput. Sci., 2019

Characterizations of graphs G having all [1, k]-factors in kG.

Hongliang Lu, Mikio Kano, Qinglin Yu

Discret. Math., 2019

Fractional Factors, Component Factors and Isolated Vertex Conditions in Graphs.

Roger Yu, Mikio Kano, Hongliang Lu

Electron. J. Comb., 2019

Connected odd factors of graphs.

Nastaran Haghparast, Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki

Australas. J Comb., 2019

2018

Weight-Equitable Subdivision of Red and Blue Points in the Plane.

Jude Buot, Mikio Kano

Int. J. Comput. Geom. Appl., 2018

Decomposition of a Graph into Two Disjoint Odd Subgraphs.

Mikio Kano, Gyula Y. Katona, Kitti Varga

Graphs Comb., 2018

Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets.

Mikio Kano, Kenta Noguchi, David Orden

CoRR, 2018

The hamburger theorem.

Mikio Kano, Jan Kyncl

Comput. Geom., 2018

2017

Balancing Colored Points on a Line by Exchanging Intervals.

Atsushi Kaneko, Mikio Kano, Mamoru Watanabe

J. Inf. Process., 2017

$K_{1, 3}$-covering red and blue points in the plane.

Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel

CoRR, 2017

2016

(1, f)-Factors of Graphs with Odd Property.

Yoshimi Egawa, Mikio Kano, Zheng Yan

Graphs Comb., 2016

Generalizations of Marriage Theorem for Degree Factors.

Radoslaw Cymer, Mikio Kano

Graphs Comb., 2016

Spanning trees with bounded degrees and leaves.

Mikio Kano, Zheng Yan

Discret. Math., 2016

m-dominating k-trees of graphs.

Mikio Kano, Kenta Ozeki, Masao Tsugaki, Guiying Yan

Discret. Math., 2016

0-Sum and 1-Sum Flows in Regular Graphs.

Saieed Akbari, Mikio Kano, Sanaz Zare

Electron. J. Comb., 2016

2015

Spanning Trees Whose Stems are Spiders.

Mikio Kano, Zheng Yan

Graphs Comb., 2015

Balanced partitions of 3-colored geometric sets in the plane.

Sergey Bereg, Ferran Hurtado, Mikio Kano, Matias Korman, Dolores Lara, Carlos Seara, Rodrigo I. Silveira, Jorge Urrutia, Kevin Verbeek

Discret. Appl. Math., 2015

Spanning $k$-trees of Bipartite Graphs.

Mikio Kano, Kenta Ozeki, Kazuhiro Suzuki, Masao Tsugaki, Tomoki Yamashita

Electron. J. Comb., 2015

2014

{k, r - k}-Factors of r-Regular Graphs.

Saieed Akbari, Mikio Kano

Graphs Comb., 2014

Star-cycle factors of graphs.

Yoshimi Egawa, Mikio Kano, Zheng Yan

Discuss. Math. Graph Theory, 2014

m-dominating k-ended trees of graphs.

Mikio Kano, Masao Tsugaki, Guiying Yan

Discret. Math., 2014

Spanning trees whose stems have at most k leaves.

Mikio Kano, Zheng Yan

Ars Comb., 2014

2013

Spanning <i>k</i>-ended trees of bipartite graphs.

Mikio Kano, Haruhide Matsuda, Masao Tsugaki, Guiying Yan

Discret. Math., 2013

A Note on Leaf-constrained Spanning Trees in a Graph.

Mikio Kano, Aung Kyaw

Ars Comb., 2013

Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane.

Mikio Kano, Kazuhiro Suzuki, Miyuki Uno

Proceedings of the Discrete and Computational Geometry and Graphs, 2013

2012

Star-factors with large components.

Mikio Kano, Akira Saito

Discret. Math., 2012

The Chromatic Index of a Graph Whose Core has Maximum Degree 2.

Mikio Kano, Saieed Akbari, Maryam Ghanbari, Mohammad Javad Nikmehr

Electron. J. Comb., 2012

Balanced Line for a 3-Colored Point Set in the Plane.

Sergey Bereg, Mikio Kano

Electron. J. Comb., 2012

Spanning trees with a bounded number of leaves in a claw-free graph.

Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita

Ars Comb., 2012

Spanning Caterpillars Having at Most k Leaves.

Mikio Kano, Tomoki Yamashita, Zheng Yan

Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

2011

Spanning <i>k</i>-Trees of <i>n</i>-Connected Graphs.

Mikio Kano, Hiroo Kishimoto

Graphs Comb., 2011

Geometric Graphs in the Plane Lattice.

Mikio Kano, Kazuhiro Suzuki

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010

Balanced Subdivisions with Boundary Condition of Two Sets of Points in the Plane.

Mikio Kano, Miyuki Uno

Int. J. Comput. Geom. Appl., 2010

Star-Uniform Graphs.

Mikio Kano, Yunjian Wu, Qinglin Yu

Graphs Comb., 2010

Component factors with large components in graphs.

Mikio Kano, Hongliang Lu, Qinglin Yu

Appl. Math. Lett., 2010

2009

Bisections of Two Sets of Points in the Plane Lattice.

Miyuki Uno, Tomoharu Kawano, Mikio Kano

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Elementary Graphs with Respect to <i>f</i>-Parity Factors.

Mikio Kano, Gyula Y. Katona, Jácint Szabó

Graphs Comb., 2009

Matching Points with Squares.

Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia

Discret. Comput. Geom., 2009

2008

Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey.

Mikio Kano, Xueliang Li

Graphs Comb., 2008

Compatible Geometric Matchings.

Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood

Electron. Notes Discret. Math., 2008

Path and cycle factors of cubic bipartite graphs.

Mikio Kano, Changwoo Lee, Kazuhiro Suzuki

Discuss. Math. Graph Theory, 2008

Encompassing colored planar straight line graphs.

Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth

Comput. Geom., 2008

Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images.

Miyuki Uno, Mikio Kano

Proceedings of the Information Security and Cryptology, 2008

2007

Spanning trees with leaf distance at least four.

Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki

J. Graph Theory, 2007

Jin Akiyama: A Friend and His Mathematics.

Mikio Kano, Mari-Jo P. Ruiz, Jorge Urrutia

Graphs Comb., 2007

Structure theorem and algorithm on (1, f)-odd subgraph.

Mikio Kano, Gyula Y. Katona

Discret. Math., 2007

Visual Cryptography Schemes with Dihedral Group Access Structure for Many Images.

Miyuki Uno, Mikio Kano

Proceedings of the Information Security Practice and Experience, 2007

2006

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees.

Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei

J. Comb. Optim., 2006

Editorial.

Jin Akiyama, Mikio Kano, Xuehou Tan

Comput. Geom., 2006

2005

Partitioning complete multipartite graphs by monochromatic trees.

Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki

J. Graph Theory, 2005

On plane spanning trees and cycles of multicolored point sets with few intersections.

Mikio Kano, Criel Merino, Jorge Urrutia

Inf. Process. Lett., 2005

Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests.

Atsushi Kaneko, Mikio Kano

Int. J. Comput. Geom. Appl., 2005

Pan-Factorial Property in Regular Graphs.

Mikio Kano, Qinglin Yu

Electron. J. Comb., 2005

General Balanced Subdivision of Two Sets of Points in the Plane.

Mikio Kano, Miyuki Uno

Proceedings of the Discrete Geometry, 2005

A Neighborhood Condition for Graphs to Have [ <i>a</i> , <i>b</i> ]-Factors III.

Mikio Kano, Haruhide Matsuda

Proceedings of the Discrete Geometry, 2005

2004

Packing paths of length at least two.

Mikio Kano, Gyula Y. Katona, Zoltán Király

Discret. Math., 2004

Matching Points with Circles and Squares.

Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Encompassing colored crossing-free geometric graphs.

Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Cycles having the same modularity and removable edges in 2-connected graphs.

Kiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito

Discret. Math., 2003

A Balanced Interval of Two Sets of Points on a Line.

Atsushi Kaneko, Mikio Kano

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002

Odd subgraphs and matchings.

Mikio Kano, Gyula Y. Katona

Discret. Math., 2002

Perfect Partitions of Convex Sets in the Plane.

Atsushi Kaneko, Mikio Kano

Discret. Comput. Geom., 2002

2001

Partial Parity (g, f)-Factors and Subgraphs Covering Given Vertex Subsets.

Mikio Kano, Haruhide Matsuda

Graphs Comb., 2001

2000

Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane.

Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto

Int. J. Comput. Geom. Appl., 2000

Straight line embeddings of rooted star forests in the plane.

Atsushi Kaneko, Mikio Kano

Discret. Appl. Math., 2000

On Paths in a Complete Bipartite Geometric Graph.

Atsushi Kaneko, Mikio Kano

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Generalized Balanced Partitions of Two Sets of Points in the Plane.

Atsushi Kaneko, Mikio Kano

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999

Straight-Line Embeddings of Two Rooted Trees in the Plane.

Atsushi Kaneko, Mikio Kano

Discret. Comput. Geom., 1999

A [k, k+1]-Factor Containing A Given Hamiltonian Cycle.

Mao-cheng Cai, Yanjun Li, Mikio Kano

Electron. J. Comb., 1999

1998

Radial Perfect Partitions of Convex Sets in the Plane.

Jin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Nakamura, Eduardo Rivera-Campo, Shin-ichi Tokunaga, Jorge Urrutia

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Straight-line embeddings of three rooted trees in the plane.

Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

Balanced partitions of two sets of points in the plane.

Atsushi Kaneko, Mikio Kano

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Star partitions of graphs.

Yoshimi Egawa, Mikio Kano, Alexander K. Kelmans

J. Graph Theory, 1997

A straight-line embedding of two or more rooted trees in the plane.

Mikio Kano

Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996

Edge-removing games of star type.

Mikio Kano

Discret. Math., 1996

Sufficient conditions for graphs to have (g, f)-factors.

Yoshimi Egawa, Mikio Kano

Discret. Math., 1996

1995

Disjoint odd integer subsets having a constant even sum.

Hikoe Enomoto, Mikio Kano

Discret. Math., 1995

1992

Binding numbers and <i>f</i>-factors of graphs.

Mikio Kano, Norihide Tokushige

J. Comb. Theory B, 1992

1990

Graphs with the balas - uhry property.

Mikio Kano, Svatopluk Poljak

J. Graph Theory, 1990

A sufficient condition for a graph to have [<i>a, b</i>]-factors.

Mikio Kano

Graphs Comb., 1990

Spanning trees fixed by automorphisms of a graph.

Mikio Kano, Akio Sakamoto

Discret. Math., 1990

Sufficient conditions for a graph to have factors.

Mikio Kano

Discret. Math., 1990

Disjoint subsets of integers having a constant sum.

Kiyoshi Ando, Severino Villanueva Gervacio, Mikio Kano

Discret. Math., 1990

1988

Some results on odd factors of graphs.

Cui Yuting, Mikio Kano

J. Graph Theory, 1988

A sufficient condition for a bipartite graph to have a <i>k</i>-factor.

Hikoe Enomoto, Katsuhiro Ota, Mikio Kano

J. Graph Theory, 1988

1987

Ranking the vertices of an r-partite paired comparison digraph.

Mikio Kano

Discret. Appl. Math., 1987

Maximum and k-th maximal spanning trees of a weighted graph.

Mikio Kano

Comb., 1987

1986

Factors of regular graphs.

Mikio Kano

J. Comb. Theory B, 1986

1985

[<i>a</i>, <i>b</i>]-factorization of a graph.

Mikio Kano

J. Graph Theory, 1985

Almost-regular factorization of graphs.

Jin Akiyama, Mikio Kano

J. Graph Theory, 1985

Factors and factorizations of graphs - a survey.

Jin Akiyama, Mikio Kano

J. Graph Theory, 1985

1983

Ranking the vertices of a weighted digraph using the length of forward arcs.

Mikio Kano, Akio Sakamoto

Networks, 1983

[a, b]-factors of graphs.

Mikio Kano, Akira Saito

Discret. Math., 1983

Cycle games and cycle cut games.

Mikio Kano

Comb., 1983

1982

On factors with given components.

Atsushi Amahashi, Mikio Kano

Discret. Math., 1982