Coloring vertices and faces of maps on surfaces
From MaRDI portal
Publication:708418
DOI10.1016/j.disc.2010.06.021zbMath1213.05091OpenAlexW1971897659MaRDI QIDQ708418
Publication date: 11 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.06.021
nonorientable surfaceone-chromatic numbertopological embedding1-immersion of graphvertex-face chromatic number
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene
- Coloring vertices and faces of locally planar graphs
- A lower bound for the one-chromatic number of a surface
- An infinite series of surfaces with known 1-chromatic number
- A possibly infinite series of surfaces with known 1-chromatic number
- The nonorientable genus of joins of complete graphs with large edgeless graphs
- A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
- The number of edges in critical graphs.
- Map-Colour Theorems