1-planar graphs without 4-cycles or 5-cycles are 5-colorable
type: Item
instance of: scholarly article
title: 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
zbMATH Open document ID: 1484.05078
author: Li-li Song
author: Lei Sun
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 7490426
zbMATH Keywords: 1-planar graph
zbMATH Keywords: colorable graph
zbMATH Keywords: discharging
zbMATH Keywords: vertices
zbMATH Keywords: faces
describes a project that uses: gCol
MaRDI profile type: Publication
full work available at URL: s10255-022-1073-9
OpenAlex ID: W4210799492
cites work: The existence of unavoidable sets of geographically good configurations
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: From light edges to strong edge-colouring of 1-planar graphs
cites work: Q3679212
cites work: (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
cites work: Q5277036
cites work: Note on improper coloring of $1$-planar graphs
cites work: The structure of 1-planar graphs
cites work: Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
cites work: An annotated bibliography on 1-planarity
cites work: An improved upper bound on the linear 2-arboricity of 1-planar graphs
cites work: Light edges in 1-planar graphs of minimum degree 3
cites work: On \((p, 1)\)-total labelling of some 1-planar graphs
cites work: Ein Sechsfarbenproblem auf der Kugel
cites work: Q3134302
cites work: Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
cites work: \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
cites work: (2,1)-total labelling of planar graphs with large maximum degree
cites work: On total colorings of 1-planar graphs
cites work: Dynamic list coloring of 1-planar graphs
cites work: On edge colorings of 1-planar graphs without adjacent triangles
cites work: Q4909715
cites work: Equitable coloring of three classes of 1-planar graphs
cites work: On edge colorings of \(1\)-planar graphs
DOI: 10.1007/S10255-022-1073-9
description: scientific article; zbMATH DE number 7490426