53 citations · 86 across the 11 of their papers we have counts for
7 papers · 1 filter
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) \…
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…
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…
-covering red and blue points in the plane
Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano +4
We say that a finite set of red and blue points in the plane in general position can be -covered if the set can be partitioned into subsets of size , with points of…
Characterization of 1-Tough Graphs using Factors
M. Kano, H. Lu
For a graph , let and denote the number of odd components and the number of components of , respectively. Then it is well-known that has a 1-factor if and…
Compatible Geometric Matchings
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu +10
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing.…