List 2-distance $$\varDelta +3$$Δ+3-coloring of planar graphs without 4,5-cycles
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0312-8
Abstract: Let $$\chi _2(G)$$χ2(G) and $$\chi _2^l(G)$$χ2l(G) be the 2-distance chromatic number and list 2-distance chromatic number of a graph G, respectively. Wegner conjectured that for each planar graph G with maximum degree $$\varDelta $$Δ at… read more here.
Keywords: distance; list distance; without cycles; vardelta ... See more keywords