List colorings of K5-minor-free graphs with special list assignments

Daniel W. Cranston, Anja Pruchnewski, Zsolt Tuza, Margit Voigt

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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) the following question has an affirmative answer. Let r and k be the integers and let G be a K5-minor-free r-connected graph that is not a Gallai tree (i.e. at least one block of G is neither a complete graph nor an odd cycle). Is G L-list colorable for every list assignment L with |L(v)| = min{d(v), k} for all v∈V(G)? We investigate this question by considering the components of G[Sk], where Sk: = {v∈V(G)|d(v)8k} is the set of vertices with small degree in G. We are especially interested in the minimum distance d(Sk) in G between the components of G[S k].

Original languageEnglish
Pages (from-to)18-30
Number of pages13
JournalJournal of Graph Theory
Volume71
Issue number1
DOIs
Publication statusPublished - Sep 2012

Keywords

  • graph coloring
  • list coloring
  • planar

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'List colorings of K<sub>5</sub>-minor-free graphs with special list assignments'. Together they form a unique fingerprint.

  • Cite this