Mikio Kano

Orcid: 0000-0002-7545-0327

Affiliations:
  • Ibaraki University, Hitachi, Japan
  • Akashi Technological College, Akashi, Japan


According to our database1, Mikio Kano authored at least 107 papers between 1982 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Degree Factors with Red-Blue Coloring of Regular Graphs.
Electron. J. Comb., 2024

2023
Factors with Red-Blue Coloring of Claw-Free Graphs and Cubic Graphs.
Graphs Comb., August, 2023

2022
Factors of bi-regular bipartite graphs.
Discret. Appl. Math., 2022

2021
Discrete Geometry on Colored Point Sets in the Plane - A Survey.
Graphs Comb., 2021

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

Rainbow polygons for colored point sets in the plane.
Discret. Math., 2021

2020
Strong Tutte type conditions and factors of graphs.
Discuss. Math. Graph Theory, 2020

Characterization of 1-tough graphs using factors.
Discret. Math., 2020

Color degree sum conditions for properly colored spanning trees in edge-colored graphs.
Discret. Math., 2020

Properly colored spanning trees in edge-colored graphs.
Discret. Math., 2020

Existence of all generalized fractional (g, f)-factors of graphs.
Discret. Appl. Math., 2020

Spanning trees with small diameters.
AKCE Int. J. Graphs Comb., 2020

2019
K<sub>1,3</sub>-covering red and blue points in the plane.
Discret. Math. Theor. Comput. Sci., 2019

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

Fractional Factors, Component Factors and Isolated Vertex Conditions in Graphs.
Electron. J. Comb., 2019

Connected odd factors of graphs.
Australas. J Comb., 2019

2018
Weight-Equitable Subdivision of Red and Blue Points in the Plane.
Int. J. Comput. Geom. Appl., 2018

Decomposition of a Graph into Two Disjoint Odd Subgraphs.
Graphs Comb., 2018

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

The hamburger theorem.
Comput. Geom., 2018

2017
Balancing Colored Points on a Line by Exchanging Intervals.
J. Inf. Process., 2017

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

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

Generalizations of Marriage Theorem for Degree Factors.
Graphs Comb., 2016

Spanning trees with bounded degrees and leaves.
Discret. Math., 2016

m-dominating k-trees of graphs.
Discret. Math., 2016

0-Sum and 1-Sum Flows in Regular Graphs.
Electron. J. Comb., 2016

2015
Spanning Trees Whose Stems are Spiders.
Graphs Comb., 2015

Balanced partitions of 3-colored geometric sets in the plane.
Discret. Appl. Math., 2015

Spanning $k$-trees of Bipartite Graphs.
Electron. J. Comb., 2015

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

Star-cycle factors of graphs.
Discuss. Math. Graph Theory, 2014

m-dominating k-ended trees of graphs.
Discret. Math., 2014

Spanning trees whose stems have at most k leaves.
Ars Comb., 2014

2013
Spanning <i>k</i>-ended trees of bipartite graphs.
Discret. Math., 2013

A Note on Leaf-constrained Spanning Trees in a Graph.
Ars Comb., 2013

Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane.
Proceedings of the Discrete and Computational Geometry and Graphs, 2013

2012
Star-factors with large components.
Discret. Math., 2012

The Chromatic Index of a Graph Whose Core has Maximum Degree 2.
Electron. J. Comb., 2012

Balanced Line for a 3-Colored Point Set in the Plane.
Electron. J. Comb., 2012

Spanning trees with a bounded number of leaves in a claw-free graph.
Ars Comb., 2012

Spanning Caterpillars Having at Most k Leaves.
Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

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

Geometric Graphs in the Plane Lattice.
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.
Int. J. Comput. Geom. Appl., 2010

Star-Uniform Graphs.
Graphs Comb., 2010

Component factors with large components in graphs.
Appl. Math. Lett., 2010

2009
Bisections of Two Sets of Points in the Plane Lattice.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

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

Matching Points with Squares.
Discret. Comput. Geom., 2009

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

Compatible Geometric Matchings.
Electron. Notes Discret. Math., 2008

Path and cycle factors of cubic bipartite graphs.
Discuss. Math. Graph Theory, 2008

Encompassing colored planar straight line graphs.
Comput. Geom., 2008

Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images.
Proceedings of the Information Security and Cryptology, 2008

2007
Spanning trees with leaf distance at least four.
J. Graph Theory, 2007

Jin Akiyama: A Friend and His Mathematics.
Graphs Comb., 2007

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

Visual Cryptography Schemes with Dihedral Group Access Structure for Many Images.
Proceedings of the Information Security Practice and Experience, 2007

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

Editorial.
Comput. Geom., 2006

2005
Partitioning complete multipartite graphs by monochromatic trees.
J. Graph Theory, 2005

On plane spanning trees and cycles of multicolored point sets with few intersections.
Inf. Process. Lett., 2005

Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests.
Int. J. Comput. Geom. Appl., 2005

Pan-Factorial Property in Regular Graphs.
Electron. J. Comb., 2005

General Balanced Subdivision of Two Sets of Points in the Plane.
Proceedings of the Discrete Geometry, 2005

A Neighborhood Condition for Graphs to Have [ <i>a</i> , <i>b</i> ]-Factors III.
Proceedings of the Discrete Geometry, 2005

2004
Packing paths of length at least two.
Discret. Math., 2004

Matching Points with Circles and Squares.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Encompassing colored crossing-free geometric graphs.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Cycles having the same modularity and removable edges in 2-connected graphs.
Discret. Math., 2003

A Balanced Interval of Two Sets of Points on a Line.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002
Odd subgraphs and matchings.
Discret. Math., 2002

Perfect Partitions of Convex Sets in the Plane.
Discret. Comput. Geom., 2002

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

2000
Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane.
Int. J. Comput. Geom. Appl., 2000

Straight line embeddings of rooted star forests in the plane.
Discret. Appl. Math., 2000

On Paths in a Complete Bipartite Geometric Graph.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Generalized Balanced Partitions of Two Sets of Points in the Plane.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999
Straight-Line Embeddings of Two Rooted Trees in the Plane.
Discret. Comput. Geom., 1999

Balanced partitions of two sets of points in the plane.
Comput. Geom., 1999

A [k, k+1]-Factor Containing A Given Hamiltonian Cycle.
Electron. J. Comb., 1999

1998
Radial Perfect Partitions of Convex Sets in the Plane.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Straight-line embeddings of three rooted trees in the plane.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
Star partitions of graphs.
J. Graph Theory, 1997

A straight-line embedding of two or more rooted trees in the plane.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996
Edge-removing games of star type.
Discret. Math., 1996

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

1995
Disjoint odd integer subsets having a constant even sum.
Discret. Math., 1995

1992
Binding numbers and <i>f</i>-factors of graphs.
J. Comb. Theory, Ser. B, 1992

1990
Graphs with the balas - uhry property.
J. Graph Theory, 1990

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

Spanning trees fixed by automorphisms of a graph.
Discret. Math., 1990

Sufficient conditions for a graph to have factors.
Discret. Math., 1990

Disjoint subsets of integers having a constant sum.
Discret. Math., 1990

1988
Some results on odd factors of graphs.
J. Graph Theory, 1988

A sufficient condition for a bipartite graph to have a <i>k</i>-factor.
J. Graph Theory, 1988

1987
Ranking the vertices of an r-partite paired comparison digraph.
Discret. Appl. Math., 1987

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

1986
Factors of regular graphs.
J. Comb. Theory, Ser. B, 1986

1985
[<i>a</i>, <i>b</i>]-factorization of a graph.
J. Graph Theory, 1985

Almost-regular factorization of graphs.
J. Graph Theory, 1985

Factors and factorizations of graphs - a survey.
J. Graph Theory, 1985

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

[a, b]-factors of graphs.
Discret. Math., 1983

Cycle games and cycle cut games.
Comb., 1983

1982
On factors with given components.
Discret. Math., 1982


  Loading...