List colorings of K 5-minor-free graphs with special list assignments

Daniel W. Cranston, Anja Pruchnewski, Z. 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 K 5-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[S k], where S k: = {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(S k) 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

Fingerprint

List Coloring
Complete Graph
Connected graph
Minor
Assignment
Odd Cycle
Minimum Distance
Graph in graph theory
Integer
Vertex of a graph

Keywords

  • graph coloring
  • k -minor-free
  • list coloring
  • planar

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

List colorings of K 5-minor-free graphs with special list assignments. / Cranston, Daniel W.; Pruchnewski, Anja; Tuza, Z.; Voigt, Margit.

In: Journal of Graph Theory, Vol. 71, No. 1, 09.2012, p. 18-30.

Research output: Contribution to journalArticle

Cranston, Daniel W. ; Pruchnewski, Anja ; Tuza, Z. ; Voigt, Margit. / List colorings of K 5-minor-free graphs with special list assignments. In: Journal of Graph Theory. 2012 ; Vol. 71, No. 1. pp. 18-30.
@article{4d6db9077dae418da533d991746337fb,
title = "List colorings of K 5-minor-free graphs with special list assignments",
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 K 5-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[S k], where S k: = {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(S k) in G between the components of G[S k].",
keywords = "graph coloring, k -minor-free, list coloring, planar",
author = "Cranston, {Daniel W.} and Anja Pruchnewski and Z. Tuza and Margit Voigt",
year = "2012",
month = "9",
doi = "10.1002/jgt.20628",
language = "English",
volume = "71",
pages = "18--30",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - List colorings of K 5-minor-free graphs with special list assignments

AU - Cranston, Daniel W.

AU - Pruchnewski, Anja

AU - Tuza, Z.

AU - Voigt, Margit

PY - 2012/9

Y1 - 2012/9

N2 - 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 K 5-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[S k], where S k: = {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(S k) in G between the components of G[S k].

AB - 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 K 5-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[S k], where S k: = {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(S k) in G between the components of G[S k].

KW - graph coloring

KW - k -minor-free

KW - list coloring

KW - planar

UR - http://www.scopus.com/inward/record.url?scp=84864462189&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84864462189&partnerID=8YFLogxK

U2 - 10.1002/jgt.20628

DO - 10.1002/jgt.20628

M3 - Article

VL - 71

SP - 18

EP - 30

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 1

ER -