# Search results for: Xueliang Li

Journal of Combinatorial Optimization > 2017 > 34 > 2 > 441-452

*G*is a function $$f:V\rightarrow N$$ f : V → N such that $$f(x)\ne f(y)$$ f ( x ) ≠ f ( y ) for every edge $$xy\in E$$ x y ∈ E . A proper coloring of a graph

*G*such that for every $$k\ge 1$$ k ≥ 1 , the union of any

*k*color classes induces a $$(k-1)$$ ( k - 1 ) -degenerate...

Discrete Mathematics > 2010 > 310 > 17-18 > 2448-2451