M. Kano

activity

20072026

most citedCompatible Geometric Matchings

53 citations · 86 across the 11 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

cs.DM2019

Strengthening some complexity results on toughness of graphs

Gyula Y Katona, Kitti Varga

Let $t$ be a positive real number. A graph is called $t$ -tough if the removal of any vertex set $S$ that disconnects the graph leaves at most $∣ S ∣/ t$ components. The toughness of a…

math.CO2019★ 3 cited

Fractional Factors, Component Factors and Isolated Vertex Conditions in Graphs

Mikio Kano, Hongliang Lu, Qinglin Yu

For a graph $G = (V, E)$ , a {\em fractional $[a, b]$ -factor} is a real valued function $h : E (G) \to [0, 1]$ that satisfies $a \leq \sum_{e \in E_{G} (v)} h (e) \leq b$ for all $ v\in V(G…