✦ LIBER ✦

List-colouring the square of a -minor-free graph

✍ Scribed by Timothy J. Hetherington; Douglas R. Woodall

Book ID: 108113877
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 195 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.07.102

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Brooks-type bound for squares of -mino

A Brooks-type bound for squares of -minor-free graphs

✍ Alexandr V. Kostochka; Lale Özkahya; Douglas R. Woodall 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 972 KB

List-coloring the square of a subcubic g

List-coloring the square of a subcubic graph

✍ Daniel W. Cranston; Seog-Jin Kim 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB 👁 1 views

## Abstract The __square__ __G__^2^ of a graph __G__ is the graph with the same vertex set __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 χ(__G__^2^) ≤ 7. Kostochka and Woodall c

List Colorings of K5-Minor-Free Graphs W

List Colorings of K5-Minor-Free Graphs With Special List Assignments

✍ Daniel W. Cranston; Anja Pruchnewski; Zsolt Tuza; Margit Voigt 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

The following question was raised by Bruce Richter. Let G be a planar, 3-connected graph that is not a complete graph. Denoting by d(v) the degree of vertex v, is G L-list colorable for every list assignment L with |L(v)|=min{d(v), 6} for all v ∈ V (G)? More generally, we ask for which pairs (r, k)

On a class of square-free graphs

✍ Xue Qingbo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 171 KB

List Colouring When The Chromatic Number

List Colouring When The Chromatic Number Is Close To the Order Of The Graph

✍ Bruce Reed*; Benny Sudakov† 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 151 KB

The square of a chordal graph

✍ Frank Harary; Terry A. McKee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 427 KB

We introduce the closed-neighborhood intersection multigraph as a useful multigraph version of the square of a graph. We characterize those multigraphs which are squares of chordal graphs and include an algorithm to go from the squared chordal graph back to its (unique!) square root. This becomes pa