On irreducible no-hole L(2, 1)-coloring of subdivision of graphs
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0047-3
Abstract: An L(2, 1)-coloring (or labeling) of a graph G is a mapping $$f:V(G) \rightarrow \mathbb {Z}^{+}\bigcup \{0\}$$f:V(G)→Z+⋃{0} such that $$|f(u)-f(v)|\ge 2$$|f(u)-f(v)|≥2 for all edges uv of G, and $$|f(u)-f(v)|\ge 1$$|f(u)-f(v)|≥1 if u and v are at… read more here.
Keywords: hole coloring; span; inh; irreducible hole ... See more keywords