1-planar graphs without 4-cycles or 5-cycles are 5-colorable

DOI10.1007/S10255-022-1073-9MaRDI QIDQ2115229zbMATH OpenOpenAlexFDO

Authors Li-li Song, Lei Sun

Publication date 15 March 2022

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10255-022-1073-9

zbMATH Keywords

dischargingverticesfaces1-planar graphcolorable graph

Mathematics Subject Classification ID

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

Recommendations

• Every 1-planar graph without cycles of length 3 or 4 is 5-colorable
• Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.
• Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
• scientific article; zbMATH DE number 7029178
• scientific article; zbMATH DE number 6746684

Cites work

• scientific article; zbMATH DE number 3900784 (Why is no real title available?)
• scientific article; zbMATH DE number 6746684 (Why is no real title available?)
• (2,1)-total labelling of planar graphs with large maximum degree
• (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
• An annotated bibliography on 1-planarity
• An improved upper bound on the linear 2-arboricity of 1-planar graphs
• Dynamic list coloring of 1-planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• Equitable coloring of three classes of 1-planar graphs
• Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• From light edges to strong edge-colouring of 1-planar graphs
• Light edges in 1-planar graphs of minimum degree 3
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
• Note on improper coloring of 1-planar graphs.
• On \((p, 1)\)-total labelling of some 1-planar graphs
• On edge colorings of 1-planar graphs without adjacent triangles
• On edge colorings of 1-planar graphs without chordal 5-cycles.
• On edge colorings of \(1\)-planar graphs
• On total colorings of 1-planar graphs
• Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
• The existence of unavoidable sets of geographically good configurations
• The structure of 1-planar graphs
• \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9

Cited in

(4)

• 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable
• Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable.
• Every 1-planar graph without cycles of length 3 or 4 is 5-colorable
• Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable

Describes a project that uses

Uses Software

• gCol

This page was built for publication: 1-planar graphs without 4-cycles or 5-cycles are 5-colorable

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