Application of polynomial method to on-line list colouring of graphs
From MaRDI portal
(Redirected from Publication:412279)
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
- scientific article; zbMATH DE number 446487 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 2192112 (Why is no real title available?)
- 25 pretty graph colouring problems
- 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
- Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
- Graph colorings with local constraints -- a survey
- Irregular Assignments of Trees and Forests
- List colouring when the chromatic number is close to the order of the graph
- Mr. Paint and Mrs. Correct
- Multicriterial graph problems with MAXMIN criterion
- Ohba's conjecture is true for graphs with independence number at most three
- On choosability of some complete multipartite graphs and Ohba's conjecture
- On chromatic‐choosable graphs
- On-line list colouring of graphs
- Some upper bounds on the total and list chromatic numbers of multigraphs
- The list chromatic index of a bipartite multigraph
- The number of edge 3-colorings of a planar cubic graph as a permanent
Cited in
(14)- Partial online list coloring of graphs
- Towards a version of Ohba's conjecture for improper colorings
- Chromatic λ‐choosable and λ‐paintable graphs
- The list-chromatic index of \(K_6\)
- Critically paintable, choosable or colorable graphs
- A strengthening and an efficient implementation of Alon-Tarsi list coloring method
- 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
- On-line DP-coloring of graphs
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- Locally planar graphs are 2-defective 4-paintable
- List-coloring claw-free graphs with \(\Delta-1\) colors
- 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)
