Planar graphs that exclude \4, 5, 7, 8\-cycles and intersecting triangles are DP-3-colorable
From MaRDI portal
Publication:7324955
Cites work
- A sufficient condition for DP-4-colorability
- Bordeaux 3-color conjecture and 3-choosability
- Colorings of plane graphs: a survey
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- DP-3-coloring of planar graphs without certain cycles
- 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
- Every planar graph is 5-choosable
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- On 3-choosability of planar graphs without certain cycles
- Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable
- Planar graphs without 7-cycles and butterflies are DP-4-colorable
- Planar graphs without chordal 6-cycles and necklaces are DP-4-colorable
- Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
- Toroidal graphs without K₅^- and 6-cycles
- Variable degeneracy of planar graphs without chorded 6-cycles
This page was built for publication: Planar graphs that exclude \(\{4, 5, 7, 8\}\)-cycles and intersecting triangles are DP-3-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7324955)
