Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable
From MaRDI portal
Publication:6072035
zbMATH Open1527.05044MaRDI QIDQ6072035FDOQ6072035
Authors: Xiangwen Li, Mao Zhang 
Publication date: 29 November 2023
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/87/ajc_v87_p086.pdf
Recommendations
- DP-4-colorability of planar graphs without adjacent cycles of given length
- Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable
- DP-coloring on planar graphs without given adjacent short cycles
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
- Planar graphs without chordal 6-cycles and necklaces are DP-4-colorable
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
- On DP-coloring of graphs and multigraphs
- The asymptotic behavior of the correspondence chromatic number
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
- DP-3-coloring of some planar graphs
- A sufficient condition for DP-4-colorability
- DP-colorings of graphs with high chromatic number
- The Johansson-Molloy theorem for DP-coloring
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
- DP-4-coloring of planar graphs with some restrictions on cycles
- DP-4-colorability of planar graphs without adjacent cycles of given length
- DP-4-colorability of two classes of planar graphs
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles
Cited In (3)
This page was built for publication: Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072035)
