Application of polynomial method to on-line list colouring of graphs
From MaRDI portal
Publication:412279
DOI10.1016/J.EJC.2011.09.020zbMATH Open1239.05067OpenAlexW2041164553MaRDI QIDQ412279FDOQ412279
Authors: 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
Recommendations
- Erratum to ``Application of polynomial method to on-line list colouring of graphs
- List colouring and partial list colouring of graphs on-line
- On-line list colouring of graphs
- On-line list colouring of complete multipartite graphs
- On-line and list on-line colorings of graphs and hypergraphs
- The polynomial method for list-colouring extendability of outerplanar graphs
- Partial online list coloring of graphs
- On-line list coloring of matroids
- On-line list colouring of random graphs
- On-line P-coloring of graphs
Cites Work
- Mr. Paint and Mrs. Correct
- Title not available (Why is that?)
- Some upper bounds on the total and list chromatic numbers of multigraphs
- Ohba's conjecture is true for graphs with independence number at most three
- On choosability of some complete multipartite graphs and Ohba's conjecture
- Graph colorings with local constraints -- a survey
- On chromatic‐choosable graphs
- Title not available (Why is that?)
- List colouring when the chromatic number is close to the order of the graph
- Irregular Assignments of Trees and Forests
- 25 pretty graph colouring problems
- The list chromatic index of a bipartite multigraph
- Multicriterial graph problems with MAXMIN criterion
- Title not available (Why is that?)
- The number of edge 3-colorings of a planar cubic graph as a permanent
- On-line list colouring of graphs
- Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
- A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
- Brooks' theorem via the Alon-Tarsi theorem
- Choice number of 3-colorable elementary graphs
Cited In (13)
- Locally planar graphs are 2-defective 4-paintable
- List-coloring claw-free graphs with \(\Delta-1\) colors
- Towards an on-line version of Ohba's conjecture
- Towards a version of Ohba's conjecture for improper colorings
- Critically paintable, choosable or colorable graphs
- Chromatic λ‐choosable and λ‐paintable graphs
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- On-line DP-coloring of graphs
- Partial online list coloring of graphs
- On-line choice number of complete multipartite graphs: an algorithmic approach
- On improperly chromatic-choosable graphs
- The list-chromatic index of \(K_6\)
- A proof of a conjecture of Ohba
This page was built for publication: Application of polynomial method to on-line list colouring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412279)
