From the plane to higher surfaces
From MaRDI portal
Publication:444375
DOI10.1016/J.JCTB.2012.03.001zbMATH Open1244.05075OpenAlexW2026401558WikidataQ56926580 ScholiaQ56926580MaRDI QIDQ444375FDOQ444375
Carsten Thomassen, Ken-ichi Kawarabayashi
Publication date: 14 August 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2012.03.001
Recommendations
- Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
- Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
- Further extensions of the Grötzsch theorem
- 3-list-coloring graphs of girth at least five on surfaces
- Improper coloring of graphs on surfaces
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- On acyclic colorings of planar graphs
- Graphs on surfaces
- Title not available (Why is that?)
- Acyclic colorings of planar graphs
- Five-coloring maps on surfaces
- Every planar graph is 5-choosable
- The four-colour theorem
- Coloring with no 2-colored \(P_4\)'s
- The chromatic number of a graph of girth 5 on a fixed surface
- A short list color proof of Grötzsch's theorem
- 3-list-coloring planar graphs of girth 5
- Every Planar Map is Four Colorable
- Coloring graphs with fixed genus and girth
- List colourings of planar graphs
- Star Coloring and Acyclic Coloring of Locally Planar Graphs
- Title not available (Why is that?)
- Locally planar graphs are 5-choosable
- Decomposing a planar graph of girth 5 into an independent set and a forest
- Partitioning into graphs with only small components
- Acyclic colorings of locally planar graphs
- Decomposing a planar graph into an independent set and a 3-degenerate graph
- Decomposing a planar graph into degenerate graphs
- Title not available (Why is that?)
- Algorithms – ESA 2004
Cited In (8)
- A search for higher-dimensional arc planes
- Title not available (Why is that?)
- Islands in Graphs on Surfaces
- Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
- Boxicity and topological invariants
- Colouring Planar Graphs With Three Colours and No Large Monochromatic Components
- Box representations of embedded graphs
- Hyperbolic families and coloring graphs on surfaces
This page was built for publication: From the plane to higher surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444375)
