DP-coloring on planar graphs without given adjacent short cycles
From MaRDI portal
Publication:5012814
DOI10.1142/S1793830921500130zbMath1479.05106OpenAlexW3082009222MaRDI QIDQ5012814
Publication date: 25 November 2021
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921500130
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- List colourings of planar graphs
- The 4-choosability of plane graphs without 4-cycles
- Every planar graph is 5-choosable
- Choosability and edge choosability of planar graphs without five cycles
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
- A sufficient condition for DP-4-colorability
- On structure of some plane graphs with application to choosability
- Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
- Planar graphs without 7-cycles and butterflies are DP-4-colorable
- DP-4-colorability of planar graphs without adjacent cycles of given length
- DP-4-colorability of two classes of planar graphs
- Planar Graphs without 7-Cycles Are 4-Choosable
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- Unnamed Item
This page was built for publication: DP-coloring on planar graphs without given adjacent short cycles