1-planar graphs with girth at least 6 are (1,1,1,1)-colorable

DOI10.21136/cmj.2023.0418-21OpenAlexW4387740131MaRDI QIDQ6137013

Unnamed Author, Li-li Song

Publication date: 18 January 2024

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21136/cmj.2023.0418-21

zbMATH Keywords

discharging1-planar graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
• (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
• On edge colorings of 1-planar graphs without adjacent triangles
• A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
• The structure of 1-planar graphs
• The existence of unavoidable sets of geographically good configurations
• On the desingularization of the unipotent variety
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Colorings of plane graphs: a survey
• On edge colorings of \(1\)-planar graphs
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
• Ein Sechsfarbenproblem auf der Kugel
• \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
• On local structure of 1-planar graphs of minimum degree 5 and girth 4
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency

This page was built for publication: 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable