53 citations · 86 across the 11 of their papers we have counts for
12 papers
Odd Edge Colorings of Graphs with Odd Order
Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki
An {\em odd subgraph} of a graph is a subgraph in which every vertex has odd degree. A graph is said to be {\em odd -edge-colorable} if there exists an edge-coloring $E(G) \…
Rainbow polygons for colored point sets in the plane
David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval +5
Given a colored point set in the plane, a perfect rainbow polygon is a simple polygon that contains exactly one point of each color, either in its interior or on its boundary. Let…
Strengthening some complexity results on toughness of graphs
Gyula Y Katona, Kitti Varga
Let be a positive real number. A graph is called -tough if the removal of any vertex set that disconnects the graph leaves at most components. The toughness of a…
Fractional Factors, Component Factors and Isolated Vertex Conditions in Graphs
Mikio Kano, Hongliang Lu, Qinglin Yu
For a graph , a {\em fractional -factor} is a real valued function that satisfies for all $ v\in V(G…
Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets
Mikio Kano, Kenta Noguchi, David Orden
Let and be a set of red points and a set of blue points in the plane, respectively, such that is in general position, and let be a fu…
Decomposition of a graph into two disjoint odd subgraphs
Mikio Kano, Gyula Y. Katona, Kitti Varga
An odd (resp. even) subgraph in a multigraph is its subgraph in which every vertex has odd (resp. even) degree. We say that a multigraph can be decomposed into two odd subgraphs if…