Note on improper coloring of 1-planar graphs.

DOI10.21136/CMJ.2019.0558-17MaRDI QIDQ5206449zbMATH OpenOpenAlexFDO

Authors Yanan Chu, Lei Sun, Jun Yue

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)

Recommendations

• A note on improper colorability of planar graphs
• On 1-improper 2-coloring of sparse graphs
• Improper colorability of planar graphs without prescribed short cycles
• Improper colorability of planar graphs with cycles of length neither 4 nor 6
• scientific article; zbMATH DE number 6746684

Cites work

• scientific article; zbMATH DE number 3900784 (Why is no real title available?)
• A linear-time algorithm for 7-coloring 1-plane graphs
• A new proof of the 6 color theorem
• Acyclic colouring of 1-planar graphs
• Defective 2-colorings of sparse graphs
• Edge Coloring of Triangle-Free 1-Planar Graphs
• Ein Sechsfarbenproblem auf der Kugel
• Graph theory with applications
• List edge and list total coloring of 1-planar graphs
• On 1-improper 2-coloring of sparse graphs
• On edge colorings of 1-planar graphs without adjacent triangles
• On edge colorings of 1-planar graphs without chordal 5-cycles.
• 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
• Optimal 1-planar graphs which triangulate other surfaces
• Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
• Steinberg's conjecture is false
• The existence of unavoidable sets of geographically good configurations
• The structure of 1-planar graphs

Cited in

(5)

• A note on odd colorings of 1-planar graphs
• A note on improper colorability of planar graphs
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
• Graph partitions under average degree constraint
• About a Brooks-type theorem for improper colouring

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

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