On-line choice number of complete multipartite graphs: an algorithmic approach

zbMath1305.05070arXiv1305.2700MaRDI QIDQ490305

Hong-Bin Chen, Yu-Pei Huang, Fei-Huang Chang, Jun-Yi Guo

Publication date: 22 January 2015

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

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

zbMATH Keywords

Ohba's conjectureonline list coloringpaintability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Application of polynomial method to on-line list colouring of graphs
• On-line list colouring of complete multipartite graphs
• The list chromatic index of a bipartite multigraph
• A Hajós-like theorem for list coloring
• Mr. Paint and Mrs. Correct
• On-line list colouring of graphs
• Towards an on-line version of Ohba's conjecture
• Choice Numbers of Graphs: a Probabilistic Approach
• On chromatic‐choosable graphs
• A Proof of a Conjecture of Ohba
• Choosability conjectures and multicircuits

This page was built for publication: On-line choice number of complete multipartite graphs: an algorithmic approach