1-planar graphs are odd 13-colorable
From MaRDI portal
Publication:6041551
DOI10.1016/j.disc.2023.113423zbMath1519.05060arXiv2206.13967OpenAlexW4327906505MaRDI QIDQ6041551
Runrun Liu, Wei Fan Wang, Gexin Yu
Publication date: 31 May 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.13967
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
On odd colorings of planar graphs ⋮ On odd colorings of sparse graphs ⋮ IC-planar graphs are odd-10-colorable
Cites Work
- Unnamed Item
- On drawings and decompositions of 1-planar graphs
- 5-choosability of graphs with crossings far apart
- The structure of 1-planar graphs
- Unique-maximum coloring of plane graphs
- Optimal strong parity edge-coloring of complete graphs
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Colorings with neighborhood parity condition
- Remarks on odd colorings of graphs
- An improved upper bound for the acyclic chromatic number of 1-planar graphs
- Ein Sechsfarbenproblem auf der Kugel
- An annotated bibliography on 1-planarity
- Odd coloring of sparse graphs and planar graphs
- A note on odd colorings of 1-planar graphs
- Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
- Conflict-Free Colourings of Graphs and Hypergraphs
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- A new proof of the 6 color theorem
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
- Conflict-Free Colouring of Graphs
- Acyclic colouring of 1-planar graphs
This page was built for publication: 1-planar graphs are odd 13-colorable
