Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
From MaRDI portal
Publication:2107762
Recommendations
- Relaxed DP-3-coloring of planar graphs without some cycles
- DP-4-colorability of planar graphs without adjacent cycles of given length
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
- DP-coloring on planar graphs without given adjacent short cycles
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
Cites work
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 3563170 (Why is no real title available?)
- scientific article; zbMATH DE number 1250667 (Why is no real title available?)
- A generalization of some results on list coloring and DP-coloring
- A note on list improper coloring planar graphs
- An analogue of DP-coloring for variable degeneracy and its applications
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- List Improper Colourings of Planar Graphs
- On DP-coloring of graphs and multigraphs
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
- Variable degeneracy: Extensions of Brooks' and Gallai's theorems
Cited in
(4)
This page was built for publication: Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107762)