1-planar graphs with girth at least 6 are (1,1,1,1)-colorable
From MaRDI portal
(Redirected from Publication:6137013)
Cites work
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
- 1-planar graphs without 4-cycles or 5-cycles are 5-colorable
- \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
- A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
- Colorings of plane graphs: a survey
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Ein Sechsfarbenproblem auf der Kugel
- 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
- scientific article; zbMATH DE number 3900784 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 6746684 (Why is no real title available?)
- 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 local structure of 1-planar graphs of minimum degree 5 and girth 4
- On the desingularization of the unipotent variety
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
- Steinberg's conjecture is false
- The existence of unavoidable sets of geographically good configurations
- The structure of 1-planar graphs
This page was built for publication: 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137013)
