Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable
From MaRDI portal
Publication:6072035
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
Cites work
- scientific article; zbMATH DE number 1496580 (Why is no real title available?)
- A sufficient condition for DP-4-colorability
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
- DP-3-coloring of some planar graphs
- DP-4-colorability of planar graphs without adjacent cycles of given length
- DP-4-colorability of two classes of planar graphs
- DP-4-coloring of planar graphs with some restrictions on cycles
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles
- DP-colorings of graphs with high chromatic number
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
- On DP-coloring of graphs and multigraphs
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
- The Johansson-Molloy theorem for DP-coloring
- The asymptotic behavior of the correspondence chromatic number
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)
