A better lower bound on average degree of online \(k\)-list-critical graphs

zbMath1391.05117arXiv1608.06989MaRDI QIDQ1753017

Landon Rabern

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

critical graphsaverage degreelist colouringonline list colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A better lower bound on average degree of 4-list-critical graphs
• Ore's conjecture on color-critical graphs is almost true
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs
• Edge lower bounds for list critical graphs, via discharging
• Improved lower bounds on the number of edges in list critical and online list critical graphs
• Mr. Paint and Mrs. Correct
• Independence, odd girth, and average degree
• Extracting List Colorings from Large Independent Sets

This page was built for publication: A better lower bound on average degree of online \(k\)-list-critical graphs