23 citations · 322 across the 61 of their papers we have counts for
Showing 2012 · math.COShow all
2 papers · 2 filters
math.CO2012★ 8 cited
An upper bound on the fractional chromatic number of triangle-free subcubic graphs
Chun-Hung Liu
An -coloring of a graph is a function which maps the vertices of into -element subsets of some set of size in such a way that is disjoint from $f(v…
math.CO2012★ 15 cited
Linear colorings of subcubic graphs
Chun-Hung Liu, Gexin Yu
A linear coloring of a graph is a proper coloring of the vertices of the graph so that each pair of color classes induce a union of disjoint paths. In this paper, we prove that for…