3 citations · 6 across the 9 of their papers we have counts for
Showing 2014 · math.COShow all
2 papers · 2 filters
math.CO2014★ 3 cited
Equitable Coloring of Graphs with Intermediate Maximum Degree
Bor-Liang Chen, Kuo-Ching Huang, Ko-Wei Lih
If the vertices of a graph are colored with colors such that no adjacent vertices receive the same color and the sizes of any two color classes differ by at most one, then…
math.CO2014★ 2 cited
A Note on Near-factor-critical Graphs
Kuo-Ching Huang, Ko-Wei Lih
A near-factor of a finite simple graph is a matching that saturates all vertices except one. A graph is said to be near-factor-critical if the deletion of any vertex from $…