Six-Critical Graphs on the Klein Bottle
DOI10.1016/J.ENDM.2008.06.047zbMATH Open1267.05076DBLPjournals/endm/ChenettePSTYKKKL08OpenAlexW2006775616WikidataQ57601496 ScholiaQ57601496MaRDI QIDQ5301014FDOQ5301014
Nathan Chenette, Ken-ichi Kawarabayashi, Carl Yerger, Jan Kynčl, Bernard Lidický, Daniel Král', Robin Thomas, Noah Streib, Luke Postle
Publication date: 28 June 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.047
Recommendations
- 6-Critical Graphs on the Klein Bottle
- Note On 6-regular Graphs On The Klein Bottle
- Minor-minimal 6-regular graphs in the Klein bottle
- $K_6$-Minors in Triangulations on the Klein Bottle
- Chromatic properties of 6-regular graphs embedded on the Klein bottle
- scientific article
- On Kauffmann invariants for 6-valent graphs
- On Kauffmann's invariants for 6-valent graphs
- The characterization of extremal factor-critical graphs on the Klein bottle
- scientific article; zbMATH DE number 3885947
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Graphs on surfaces
- The four-colour theorem
- Color-critical graphs on a fixed surface
- The non-existence of colorings
- Five-coloring graphs on the torus
- Title not available (Why is that?)
- Every Planar Map is Four Colorable
- Map-Colour Theorems
- Five-coloring graphs on the Klein bottle
- Title not available (Why is that?)
- Subgraph Isomorphism in Planar Graphs and Related Problems
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- The Colouring of Maps
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Six-Critical Graphs on the Klein Bottle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301014)
