List coloringtheSquareofaSubcubicGraph列出着色平面子图的平方.pdfVIP

List-coloring the Square of a Subcubic Graph Daniel W. Cranston∗ Seog-Jin Kim† 5 University of Illinois Konkuk University 1 0 Urbana-Champaign, USA Seoul, Korea 2 b e August 8, 2007 F 8 2 ] O Abstract 2 C The square G of a graph G is the graph with the same vertex set as G and with . h two vertices adjacent if their distance in G is at most 2. Thomassen showed that every t 2 a planar graph G with maximum degree ∆(G) = 3 satisfies χ(G ) ≤ 7. Kostochka and 2 m Woodall conjectured that for every graph, the list-chromatic number of G equals the [ 2 2 2 chromatic number of G , that is χ (G ) = χ(G ) for all G. If true, this conjecture l 1 (together with Thomassen’s result) implies that every planar graph G with ∆(G) = 3 v 2 satisfies χ (G ) ≤ 7. We prove that every connected graph (not necessarily planar) 7 l 5 2 with ∆(G) = 3 other than the Petersen graph satisfies χ (G ) ≤ 8 (and this is best 1 l 0 possible). In addition, w