Mikio Kano

ORCID

Publication Activity (10 Years)

Years Active: 1982-2024
Publications (10 Years): 29

Top Venues

Publications

Michitaka Furuya, Mikio Kano
Degree Factors with Red-Blue Coloring of Regular Graphs. Electron. J. Comb. 31 (1) (2024)
Michitaka Furuya, Mikio Kano
Factors with Red-Blue Coloring of Claw-Free Graphs and Cubic Graphs. Graphs Comb. 39 (4) (2023)
Yoshimi Egawa, Michitaka Furuya, Mikio Kano
Factors of bi-regular bipartite graphs. Discret. Appl. Math. 322 (2022)
Mikio Kano, Jorge Urrutia
Discrete Geometry on Colored Point Sets in the Plane - A Survey. Graphs Comb. 37 (1) (2021)
David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber
Rainbow polygons for colored point sets in the plane. Discret. Math. 344 (7) (2021)
Mikio Kano, Masao Tsugaki
Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs. Graphs Comb. 37 (5) (2021)
Mikio Kano, Shun-ichi Maezawa, Katsuhiro Ota, Masao Tsugaki, Takamasa Yashima
Color degree sum conditions for properly colored spanning trees in edge-colored graphs. Discret. Math. 343 (11) (2020)
Mikio Kano, Hajime Matsumura
Spanning trees with small diameters. AKCE Int. J. Graphs Comb. 17 (1) (2020)
Mikio Kano, Zheng Yan
Strong Tutte type conditions and factors of graphs. Discuss. Math. Graph Theory 40 (4) (2020)
Yangyang Cheng, Mikio Kano, Guanghui Wang
Properly colored spanning trees in edge-colored graphs. Discret. Math. 343 (1) (2020)
Yoshimi Egawa, Mikio Kano, Maho Yokota
Existence of all generalized fractional (g, f)-factors of graphs. Discret. Appl. Math. 283 (2020)
Hongliang Lu, Mikio Kano
Characterization of 1-tough graphs using factors. Discret. Math. 343 (8) (2020)
David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber
Rainbow polygons for colored point sets in the plane. CoRR (2020)
Roger Yu, Mikio Kano, Hongliang Lu
Fractional Factors, Component Factors and Isolated Vertex Conditions in Graphs. Electron. J. Comb. 26 (4) (2019)
Hongliang Lu, Mikio Kano, Qinglin Yu
Characterizations of graphs G having all [1, k]-factors in kG. Discret. Math. 342 (12) (2019)
Nastaran Haghparast, Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki
Connected odd factors of graphs. Australas. J Comb. 73 (2019)
Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel
-covering red and blue points in the plane. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Mikio Kano, Jan Kyncl
The hamburger theorem. Comput. Geom. 68 (2018)
Jude Buot, Mikio Kano
Weight-Equitable Subdivision of Red and Blue Points in the Plane. Int. J. Comput. Geom. Appl. 28 (1) (2018)
Mikio Kano, Kenta Noguchi, David Orden
Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets. CoRR (2018)
Mikio Kano, Gyula Y. Katona, Kitti Varga
Decomposition of a Graph into Two Disjoint Odd Subgraphs. Graphs Comb. 34 (6) (2018)
Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel
$K_{1, 3}$-covering red and blue points in the plane. CoRR (2017)
Sergey Bereg, Matias Korman, Rodrigo I. Silveira, Ferran Hurtado, Dolores Lara, Jorge Urrutia, Mikio Kano, Carlos Seara, Kevin Verbeek
Balanced partitions of 3-colored geometric sets in the plane. CoRR (2017)
Atsushi Kaneko, Mikio Kano, Mamoru Watanabe
Balancing Colored Points on a Line by Exchanging Intervals. J. Inf. Process. 25 (2017)
Saieed Akbari, Mikio Kano, Sanaz Zare
0-Sum and 1-Sum Flows in Regular Graphs. Electron. J. Comb. 23 (2) (2016)
Radoslaw Cymer, Mikio Kano
Generalizations of Marriage Theorem for Degree Factors. Graphs Comb. 32 (6) (2016)
Mikio Kano, Kenta Ozeki, Masao Tsugaki, Guiying Yan
m-dominating k-trees of graphs. Discret. Math. 339 (2) (2016)
Mikio Kano, Zheng Yan
Spanning trees with bounded degrees and leaves. Discret. Math. 339 (5) (2016)
Yoshimi Egawa, Mikio Kano, Zheng Yan
(1, f)-Factors of Graphs with Odd Property. Graphs Comb. 32 (1) (2016)
Mikio Kano, Kenta Ozeki, Kazuhiro Suzuki, Masao Tsugaki, Tomoki Yamashita
Spanning $k$-trees of Bipartite Graphs. Electron. J. Comb. 22 (1) (2015)
Mikio Kano, Zheng Yan
Spanning Trees Whose Stems are Spiders. Graphs Comb. 31 (6) (2015)
Sergey Bereg, Ferran Hurtado, Mikio Kano, Matias Korman, Dolores Lara, Carlos Seara, Rodrigo I. Silveira, Jorge Urrutia, Kevin Verbeek
Balanced partitions of 3-colored geometric sets in the plane. Discret. Appl. Math. 181 (2015)
Mikio Kano, Zheng Yan
Spanning trees whose stems have at most k leaves. Ars Comb. 117 (2014)
Yoshimi Egawa, Mikio Kano, Zheng Yan
Star-cycle factors of graphs. Discuss. Math. Graph Theory 34 (1) (2014)
Mikio Kano, Masao Tsugaki, Guiying Yan
m-dominating k-ended trees of graphs. Discret. Math. 333 (2014)
Saieed Akbari, Mikio Kano
{k, r - k}-Factors of r-Regular Graphs. Graphs Comb. 30 (4) (2014)
Mikio Kano, Aung Kyaw
A Note on Leaf-constrained Spanning Trees in a Graph. Ars Comb. 108 (2013)
Mikio Kano, Kazuhiro Suzuki, Miyuki Uno
Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane. JCDCGG (2013)
Mikio Kano, Haruhide Matsuda, Masao Tsugaki, Guiying Yan
-ended trees of bipartite graphs. Discret. Math. 313 (24) (2013)
Mikio Kano, Tomoki Yamashita, Zheng Yan
Spanning Caterpillars Having at Most k Leaves. TJJCCGG (2012)
Mikio Kano, Saieed Akbari, Maryam Ghanbari, Mohammad Javad Nikmehr
The Chromatic Index of a Graph Whose Core has Maximum Degree 2. Electron. J. Comb. 19 (1) (2012)
Sergey Bereg, Mikio Kano
Balanced Line for a 3-Colored Point Set in the Plane. Electron. J. Comb. 19 (1) (2012)
Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita
Spanning trees with a bounded number of leaves in a claw-free graph. Ars Comb. 103 (2012)
Mikio Kano, Akira Saito
Star-factors with large components. Discret. Math. 312 (12-13) (2012)
Mikio Kano, Hiroo Kishimoto
-Connected Graphs. Graphs Comb. 27 (3) (2011)
Mikio Kano, Kazuhiro Suzuki
Geometric Graphs in the Plane Lattice. EGC (2011)
Mikio Kano, Yunjian Wu, Qinglin Yu
Star-Uniform Graphs. Graphs Comb. 26 (3) (2010)
Mikio Kano, Hongliang Lu, Qinglin Yu
Component factors with large components in graphs. Appl. Math. Lett. 23 (4) (2010)
Mikio Kano, Miyuki Uno
Balanced Subdivisions with Boundary Condition of Two Sets of Points in the Plane. Int. J. Comput. Geom. Appl. 20 (5) (2010)
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
Compatible geometric matchings. Comput. Geom. 42 (6-7) (2009)
Miyuki Uno, Tomoharu Kawano, Mikio Kano
Bisections of Two Sets of Points in the Plane Lattice. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2) (2009)
Mikio Kano, Gyula Y. Katona, Jácint Szabó
-Parity Factors. Graphs Comb. 25 (5) (2009)
Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia
Matching Points with Squares. Discret. Comput. Geom. 41 (1) (2009)
Mikio Kano, Xueliang Li
Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey. Graphs Comb. 24 (4) (2008)
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
Compatible Geometric Matchings. Electron. Notes Discret. Math. 31 (2008)
Mikio Kano, Changwoo Lee, Kazuhiro Suzuki
Path and cycle factors of cubic bipartite graphs. Discuss. Math. Graph Theory 28 (3) (2008)
Miyuki Uno, Mikio Kano
Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images. ICISC (2008)
Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
Encompassing colored planar straight line graphs. Comput. Geom. 39 (1) (2008)
Miyuki Uno, Mikio Kano
Visual Cryptography Schemes with Dihedral Group Access Structure for Many Images. ISPEC (2007)
Mikio Kano, Gyula Y. Katona
Structure theorem and algorithm on (1, f)-odd subgraph. Discret. Math. 307 (11-12) (2007)
Mikio Kano, Mari-Jo P. Ruiz, Jorge Urrutia
Jin Akiyama: A Friend and His Mathematics. Graphs Comb. 23 (Supplement-1) (2007)
Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki
Spanning trees with leaf distance at least four. J. Graph Theory 55 (1) (2007)
Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei
Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. J. Comb. Optim. 11 (4) (2006)
Jin Akiyama, Mikio Kano, Xuehou Tan
Editorial. Comput. Geom. 34 (1) (2006)
Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki
Partitioning complete multipartite graphs by monochromatic trees. J. Graph Theory 48 (2) (2005)
Mikio Kano, Qinglin Yu
Pan-Factorial Property in Regular Graphs. Electron. J. Comb. 12 (2005)
Mikio Kano, Criel Merino, Jorge Urrutia
On plane spanning trees and cycles of multicolored point sets with few intersections. Inf. Process. Lett. 93 (6) (2005)
Mikio Kano, Miyuki Uno
General Balanced Subdivision of Two Sets of Points in the Plane. CJCDGCGT (2005)
Mikio Kano, Haruhide Matsuda
]-Factors III. CJCDGCGT (2005)
Atsushi Kaneko, Mikio Kano
Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests. Int. J. Comput. Geom. Appl. 15 (3) (2005)
Mikio Kano, Gyula Y. Katona, Zoltán Király
Packing paths of length at least two. Discret. Math. 283 (1-3) (2004)
Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
Encompassing colored crossing-free geometric graphs. CCCG (2004)
Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia
Matching Points with Circles and Squares. JCDCG (2004)
Atsushi Kaneko, Mikio Kano
A Balanced Interval of Two Sets of Points on a Line. IJCCGGT (2003)
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. Discret. Math. 265 (1-3) (2003)
Mikio Kano, Gyula Y. Katona
Odd subgraphs and matchings. Discret. Math. 250 (1-3) (2002)
Mikio Kano, Haruhide Matsuda
Partial Parity (g, f)-Factors and Subgraphs Covering Given Vertex Subsets. Graphs Comb. 17 (3) (2001)
Atsushi Kaneko, Mikio Kano
On Paths in a Complete Bipartite Geometric Graph. JCDCG (2000)
Atsushi Kaneko, Mikio Kano
Straight line embeddings of rooted star forests in the plane. Discret. Appl. Math. 101 (1-3) (2000)
Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto
Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. Int. J. Comput. Geom. Appl. 10 (1) (2000)
Atsushi Kaneko, Mikio Kano
Generalized Balanced Partitions of Two Sets of Points in the Plane. JCDCG (2000)
Atsushi Kaneko, Mikio Kano
Balanced partitions of two sets of points in the plane. Comput. Geom. 13 (4) (1999)
Mao-cheng Cai, Yanjun Li, Mikio Kano
A [k, k+1]-Factor Containing A Given Hamiltonian Cycle. Electron. J. Comb. 6 (1999)
Atsushi Kaneko, Mikio Kano
Straight-Line Embeddings of Two Rooted Trees in the Plane. Discret. Comput. Geom. 21 (4) (1999)
Atsushi Kaneko, Mikio Kano
Balanced partitions of two sets of points 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)
Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga
Straight-line embeddings of three rooted trees in the plane. CCCG (1998)
Mikio Kano
A straight-line embedding of two or more rooted trees in the plane. CCCG (1997)
Yoshimi Egawa, Mikio Kano, Alexander K. Kelmans
Star partitions of graphs. J. Graph Theory 25 (3) (1997)
Mikio Kano
Edge-removing games of star type. Discret. Math. 151 (1-3) (1996)
Yoshimi Egawa, Mikio Kano
Sufficient conditions for graphs to have (g, f)-factors. Discret. Math. 151 (1-3) (1996)
Hikoe Enomoto, Mikio Kano
Disjoint odd integer subsets having a constant even sum. Discret. Math. 137 (1-3) (1995)
Mikio Kano, Norihide Tokushige
-factors of graphs. J. Comb. Theory, Ser. B 54 (2) (1992)
Mikio Kano
Sufficient conditions for a graph to have factors. Discret. Math. 80 (2) (1990)
Mikio Kano, Svatopluk Poljak
Graphs with the balas - uhry property. J. Graph Theory 14 (5) (1990)
Mikio Kano
]-factors. Graphs Comb. 6 (3) (1990)
Mikio Kano, Akio Sakamoto
Spanning trees fixed by automorphisms of a graph. Discret. Math. 82 (2) (1990)
Kiyoshi Ando, Severino Villanueva Gervacio, Mikio Kano
Disjoint subsets of integers having a constant sum. Discret. Math. 82 (1) (1990)
Cui Yuting, Mikio Kano
Some results on odd factors of graphs. J. Graph Theory 12 (3) (1988)
Hikoe Enomoto, Katsuhiro Ota, Mikio Kano
-factor. J. Graph Theory 12 (1) (1988)

Mikio Kano.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mikio Kano