Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
DOI10.7151/DMGT.2405zbMATH Open1504.05098OpenAlexW3159222189MaRDI QIDQ2107762FDOQ2107762
Authors: Sarawute Sribunhung, Kittikorn Nakprasit, Pongpat Sittitrai, Keaitsuda Nakprasit 
Publication date: 2 December 2022
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2405
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- List Improper Colourings of Planar Graphs
- A note on list improper coloring planar graphs
- Variable degeneracy: Extensions of Brooks' and Gallai's theorems
- On DP-coloring of graphs and multigraphs
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
- An analogue of DP-coloring for variable degeneracy and its applications
- A generalization of some results on list coloring and DP-coloring
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)
