Highly Influenced

5 Excerpts

@article{Cranston2008ListcoloringTS, title={List-coloring the square of a subcubic graph}, author={Daniel W. Cranston and Seog-Jin Kim}, journal={Journal of Graph Theory}, year={2008}, volume={57}, pages={65-87} }

- Published in Journal of Graph Theory 2008
DOI:10.1002/jgt.20273

The square G2 of a graph G is the graph with the same vertex set as G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that every planar graph G with maximum degree ∆(G) = 3 satisfies χ(G2) ≤ 7. Kostochka and Woodall conjectured that for every graph, the list-chromatic number of G2 equals the chromatic number of G2, that is χl(G 2) = χ(G2) for all G. If true, this conjecture (together with Thomassen’s result) implies that every planar graph G with ∆(G) = 3… CONTINUE READING

SHOWING 1-10 OF 27 CITATIONS

Highly Influenced

5 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

6 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

6 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

3 Excerpts

Highly Influenced

4 Excerpts

Loading similar papers…