Partial online list coloring of graphs
From MaRDI portal
Recommendations
Cites work
- A note on partial list coloring
- A paintability version of the combinatorial Nullstellensatz, and list colorings of \(k\)-partite \(k\)-uniform hypergraphs
- Algorithmic aspects of partial list colourings
- Application of polynomial method to on-line list colouring of graphs
- Brooks' theorem via the Alon-Tarsi theorem
- Choice Numbers of Graphs: a Probabilistic Approach
- Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
- Graph colorings with local constraints -- a survey
- scientific article; zbMATH DE number 1383704 (Why is no real title available?)
- Mr. Paint and Mrs. Correct
- On-line list colouring of complete multipartite graphs
- On-line list colouring of graphs
- Partial list colorings
- Towards an on-line version of Ohba's conjecture
Cited in
(7)- On-line list colouring of graphs
- Bounds on partial online list colouring
- List colouring and partial list colouring of graphs on-line
- A note on partial list coloring
- Application of polynomial method to on-line list colouring of graphs
- scientific article; zbMATH DE number 7614204 (Why is no real title available?)
- Locally planar graphs are 2-defective 4-paintable
This page was built for publication: Partial online list coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2862550)
