Application of polynomial method to on-line list colouring of graphs
From MaRDI portal
Publication:412279
DOI10.1016/j.ejc.2011.09.020zbMath1239.05067OpenAlexW2041164553MaRDI QIDQ412279
Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu
Publication date: 4 May 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.020
Related Items (13)
List-Coloring Claw-Free Graphs with $\Delta-1$ Colors ⋮ Chromatic λ‐choosable and λ‐paintable graphs ⋮ On-line DP-coloring of graphs ⋮ The list-chromatic index of \(K_6\) ⋮ Towards an on-line version of Ohba's conjecture ⋮ On-line choice number of complete multipartite graphs: an algorithmic approach ⋮ On improperly chromatic-choosable graphs ⋮ Towards a version of Ohba's conjecture for improper colorings ⋮ Critically paintable, choosable or colorable graphs ⋮ Locally planar graphs are 2-defective 4-paintable ⋮ Proof of the list edge coloring conjecture for complete graphs of prime degree ⋮ A Proof of a Conjecture of Ohba ⋮ Partial Online List Coloring of Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List colouring when the chromatic number is close to the order of the graph
- A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
- Brooks' theorem via the Alon-Tarsi theorem
- Ohba's conjecture is true for graphs with independence number at most three
- Choice number of 3-colorable elementary graphs
- The number of edge 3-colorings of a planar cubic graph as a permanent
- The list chromatic index of a bipartite multigraph
- 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
- On choosability of some complete multipartite graphs and Ohba's conjecture
- Irregular Assignments of Trees and Forests
- Some upper bounds on the total and list chromatic numbers of multigraphs
- Graph colorings with local constraints -- a survey
- On chromatic‐choosable graphs
- 25 pretty graph colouring problems
This page was built for publication: Application of polynomial method to on-line list colouring of graphs
