1-planar graphs without 4-cycles or 5-cycles are 5-colorable
From MaRDI portal
Publication:2115229
DOI10.1007/s10255-022-1073-9zbMath1484.05078OpenAlexW4210799492MaRDI QIDQ2115229
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
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- An improved upper bound on the linear 2-arboricity of 1-planar graphs
- The structure of 1-planar graphs
- The existence of unavoidable sets of geographically good configurations
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Equitable coloring of three classes of 1-planar graphs
- On edge colorings of \(1\)-planar graphs
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
- On \((p, 1)\)-total labelling of some 1-planar graphs
- Light edges in 1-planar graphs of minimum degree 3
- On total colorings of 1-planar graphs
- Ein Sechsfarbenproblem auf der Kugel
- An annotated bibliography on 1-planarity
- \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
- Dynamic list coloring of 1-planar graphs
- (2,1)-total labelling of planar graphs with large maximum degree
- From light edges to strong edge-colouring of 1-planar graphs
- Note on improper coloring of $1$-planar graphs
This page was built for publication: 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
