Planar graphs without chordal 6-cycles and necklaces are DP-4-colorable

DOI10.11845/SXJZ.2020060BMaRDI QIDQ5038381zbMATH OpenOpenAlexFDO

Authors Danjun Huang, Jingran Qi

Publication date 30 September 2022

Full work available at URL http://www.oaj.pku.edu.cn/sxjz/CN/10.11845/sxjz.2020060b

zbMATH Keywords

chordcycleDP-chromatic numberplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• DP-4-colorability of planar graphs without adjacent cycles of given length
• DP-4-colorability of two classes of planar graphs
• 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 7-cycles and butterflies are DP-4-colorable

Cites work

• A sufficient condition for DP-4-colorability
• Choosability and edge choosability of planar graphs without five cycles
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• 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
• Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• List colourings of planar graphs
• On structure of some plane graphs with application to choosability
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
• Planar graphs without 7-cycles and butterflies are DP-4-colorable
• Planar Graphs without 7-Cycles Are 4-Choosable
• Planar graphs without chordal 6-cycles are 4-choosable
• The 4-choosability of plane graphs without 4-cycles

Cited in

(5)

• Planar graphs without 7-cycles and butterflies are DP-4-colorable
• DP-4-colorability of planar graphs without adjacent cycles of given length
• Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable
• Variable degeneracy of planar graphs without chorded 6-cycles
• Planar graphs that exclude \(\{4, 5, 7, 8\}\)-cycles and intersecting triangles are DP-3-colorable

This page was built for publication: Planar graphs without chordal 6-cycles and necklaces are DP-4-colorable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5038381)