Entire coloring of 2-connected plane graphs
From MaRDI portal
Publication:2662784
DOI10.1016/j.ejc.2020.103286zbMath1461.05097OpenAlexW3118927660MaRDI QIDQ2662784
Xiaoxue Hu, Wei Fan Wang, Yi Qiao Wang
Publication date: 14 April 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2020.103286
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Entire colouring of plane graphs
- Upper bounds of entire chromatic number of plane graphs
- Ein Sechsfarbenproblem auf der Kugel
- A seven-color theorem on the sphere
- Every planar map is four colorable
- On the Entire Coloring Conjecture
- Structural theorem on plane graphs with application to the entire coloring number
- A new proof of the 6 color theorem
- Planar Graphs with $\Delta\ge 9$ are Entirely $(\Delta+2)$-Colorable
- Plane Graphs with Maximum Degree Are Entirely ‐Colorable
This page was built for publication: Entire coloring of 2-connected plane graphs