DP-4-colorability of planar graphs without adjacent cycles of given length

DOI10.1016/j.dam.2019.09.012zbMath1435.05080WikidataQ127104848 ScholiaQ127104848MaRDI QIDQ2306602

Gexin Yu, Pongpat Sittitrai, Xiangwen Li, Runrun Liu, Kittikorn Nakprasit

Publication date: 23 March 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.09.012

zbMATH Keywords

cycles; planar graphs; list colorings; DP-colorings

Mathematics Subject Classification ID

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C12: Distance in graphs

Related Items

DP-coloring on planar graphs without given adjacent short cycles, 不含带弦6-圈和项链图的平面图是DP-4-可染的, Unnamed Item, A sufficient condition for planar graphs to be DP-4-colorable, Weak degeneracy of planar graphs without 4- and 6-cycles, A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles, Planar graphs without specific cycles are 2-degenerate, DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles, Relaxed DP-3-coloring of planar graphs without some cycles, Upper bound for DP-chromatic number of a graph, Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate, Planar graphs without normally adjacent short cycles, Planar graphs without 7-cycles and butterflies are DP-4-colorable, Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable, Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sufficient condition for a planar graph to be 4-choosable
• List colourings of planar graphs
• Planar graphs without cycles of specific lengths
• Planar graphs without 4-cycles adjacent to triangles are 4-choosable
• The complexity of planar graph choosability
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
• A sufficient condition for DP-4-colorability
• On DP-coloring of graphs and multigraphs
• Planar graphs without intersecting 5-cycles are 4-choosable
• Planar graphs without triangular 4-cycles are 3-choosable
• The asymptotic behavior of the correspondence chromatic number
• Planar Graphs without 7-Cycles Are 4-Choosable
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles