On-line DP-coloring of graphs
From MaRDI portal
Publication:2197455
Recommendations
Cites work
- Application of polynomial method to on-line list colouring of graphs
- Chip games and paintability
- Choosability and edge choosability of planar graphs without five cycles
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Every planar graph is 5-choosable
- Five-coloring maps on surfaces
- Locally planar graphs are 5-choosable
- Locally planar graphs are 5-paintable
- Mr. Paint and Mrs. Correct
- On DP-coloring of graphs and multigraphs
- On-line list colouring of complete multipartite graphs
- On-line list colouring of graphs
- The 4-choosability of plane graphs without 4-cycles
Cited in
(10)- Weak degeneracy of graphs
- The relation between the harmonic index and some coloring parameters
- On-line approach to off-line coloring problems on graphs with geometric representations
- Decomposition of toroidal graphs without some subgraphs
- Online Dual Edge Coloring of Paths and Trees
- scientific article; zbMATH DE number 1303205 (Why is no real title available?)
- A generalization of some results on list coloring and DP-coloring
- Decomposition of planar graphs with forbidden configurations
- Separating the online and offline DP-chromatic numbers
- Weak degeneracy of planar graphs and locally planar graphs
This page was built for publication: On-line DP-coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197455)