Note on improper coloring of $1$-planar graphs

DOI10.21136/CMJ.2019.0558-17OpenAlexW2948783856MaRDI QIDQ5206449

Jun Yue, Lei Sun, Yanan Chu

Publication date: 18 December 2019

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

Full work available at URL: https://doi.org/10.21136/cmj.2019.0558-17

zbMATH Keywords

discharging method1-planar graphimproper coloring

Mathematics Subject Classification ID

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

Related Items (2)

Graph partitions under average degree constraint ⋮ 1-planar graphs without 4-cycles or 5-cycles are 5-colorable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steinberg's conjecture is false
• On 1-improper 2-coloring of sparse graphs
• On edge colorings of 1-planar graphs without adjacent triangles
• List edge and list total coloring of 1-planar graphs
• A linear-time algorithm for 7-coloring 1-plane graphs
• The structure of 1-planar graphs
• Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
• Optimal 1-planar graphs which triangulate other surfaces
• The existence of unavoidable sets of geographically good configurations
• Ein Sechsfarbenproblem auf der Kugel
• Defective 2-colorings of sparse graphs
• Edge Coloring of Triangle-Free 1-Planar Graphs
• On local properties of 1-planar graphs with high minimum degree
• On local structure of 1-planar graphs of minimum degree 5 and girth 4
• A new proof of the 6 color theorem
• Acyclic colouring of 1-planar graphs

This page was built for publication: Note on improper coloring of $1$-planar graphs