Partial Online List Coloring of Graphs

DOI10.1002/jgt.21714zbMath1276.05048OpenAlexW1930391967MaRDI QIDQ2862550

Tsai-Lien Wong, Xuding Zhu

Publication date: 15 November 2013

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

Full work available at URL: https://doi.org/10.1002/jgt.21714

zbMATH Keywords

choice numberpartial list coloringonline choice numberonline partial list coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Bounds on partial online list colouring ⋮ Locally planar graphs are 2-defective 4-paintable

Cites Work

• Unnamed Item
• Application of polynomial method to on-line list colouring of graphs
• On-line list colouring of complete multipartite graphs
• A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
• Brooks' theorem via the Alon-Tarsi theorem
• Partial list colorings
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
• Towards an on-line version of Ohba's conjecture
• Algorithmic Aspects of Partial List Colourings
• A Note on Partial List Colorings
• Graph colorings with local constraints -- a survey
• Choice Numbers of Graphs: a Probabilistic Approach