Extracting List Colorings from Large Independent Sets

DOI10.1002/jgt.22128zbMath1375.05093arXiv1512.08130OpenAlexW2964134051MaRDI QIDQ4596317

Landon Rabern, Henry A. Kierstead

Publication date: 1 December 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.08130

zbMATH Keywords

coloringkernel lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

On the minimum number of edges in triangle-free 5-critical graphs ⋮ Structure in sparse \(k\)-critical graphs ⋮ A better lower bound on average degree of online \(k\)-list-critical graphs

This page was built for publication: Extracting List Colorings from Large Independent Sets