Coloring Eulerian triangulations of the Klein bottle
From MaRDI portal
Publication:1926035
DOI10.1007/s00373-011-1063-9zbMath1256.05072OpenAlexW2144158529WikidataQ57601375 ScholiaQ57601375MaRDI QIDQ1926035
Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Yusuke Suzuki, Ondřej Pangrác
Publication date: 27 December 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1063-9
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- List colourings of planar graphs
- Coloring even-faced graphs in the torus and the Klein bottle
- Locally planar graphs are 5-choosable
- Some simplified NP-complete graph problems
- Geometric coloring theory
- Five-coloring maps on surfaces
- Coloring Eulerian triangulations of the projective plane
- The four-colour theorem
- Extending partial 3-colourings in a planar graph
- Colouring Eulerian triangulations
- Coloring locally bipartite graphs on surfaces.
- Three-coloring graphs embedded on surfaces with all faces even-sided
- 5-chromatic even triangulations on surfaces
- Chromatic numbers of quadrangulations on closed surfaces
- Map Colour Theorems Related To the Heawood Colour Formula
- Every planar map is four colorable
- Coloring graphs with fixed genus and girth
- Dirac's map-color theorem for choosability
- 4-chromatic projective graphs
- 6-Critical Graphs on the Klein Bottle
- Coloring-flow duality of embedded graphs
- Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
