On-line DP-coloring of graphs
From MaRDI portal
Publication:2197455
DOI10.1016/J.DAM.2020.06.009zbMATH Open1447.05086OpenAlexW3037139080MaRDI QIDQ2197455FDOQ2197455
Authors: Seog-Jin Kim, Xuer Li, Alexandr Kostochka, Xuding Zhu 
Publication date: 31 August 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.06.009
Recommendations
Cites Work
- Mr. Paint and Mrs. Correct
- Five-coloring maps on surfaces
- Every planar graph is 5-choosable
- On-line list colouring of graphs
- Application of polynomial method to on-line list colouring of graphs
- On-line list colouring of complete multipartite graphs
- Locally planar graphs are 5-choosable
- Choosability and edge choosability of planar graphs without five cycles
- The 4-choosability of plane graphs without 4-cycles
- On DP-coloring of graphs and multigraphs
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Chip games and paintability
- Locally planar graphs are 5-paintable
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
- Title not available (Why is that?)
- 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)
