Color-critical graphs on a fixed surface
From MaRDI portal
Publication:1369650
DOI10.1006/jctb.1996.1722zbMath0883.05051MaRDI QIDQ1369650
Publication date: 22 February 1998
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.1722
05C15: Coloring of graphs and hypergraphs
Related Items
Coloring graphs with fixed genus and girth, Unnamed Item, You can't paint yourself into a corner, The colour theorems of Brooks and Gallai extended, Extending graph colorings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List colourings of planar graphs
- Embeddings of graphs with no short noncontractible cycles
- The complexity of planar graph choosability
- Planarity and duality of finite and infinite graphs
- Unsolved problems in geometry
- The non-existence of colorings
- Geometric coloring theory
- Five-coloring maps on surfaces
- Five-coloring graphs on the torus
- Every planar graph is 5-choosable
- Locally Planar Toroidal Graphs are 5-Colorable
- Blocks and the nonorientable genus of graphs
- Coloring graphs with fixed genus and girth
- Additivity of the genus of a graph
- The Colouring of Maps