Color-critical graphs on a fixed surface
From MaRDI portal
Publication:1369650
DOI10.1006/JCTB.1996.1722zbMATH Open0883.05051OpenAlexW1978313715MaRDI QIDQ1369650FDOQ1369650
Authors: Carsten Thomassen 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Planarity and duality of finite and infinite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Embeddings of graphs with no short noncontractible cycles
- Unsolved problems in geometry
- Five-coloring maps on surfaces
- Every planar graph is 5-choosable
- Geometric coloring theory
- The non-existence of colorings
- Five-coloring graphs on the torus
- Coloring graphs with fixed genus and girth
- Title not available (Why is that?)
- Additivity of the genus of a graph
- List colourings of planar graphs
- The complexity of planar graph choosability
- Blocks and the nonorientable genus of graphs
- The Colouring of Maps
- Locally Planar Toroidal Graphs are 5-Colorable
- Title not available (Why is that?)
Cited In (63)
- Some of my favorite coloring problems for graphs and digraphs
- Fractional coloring methods with applications to degenerate graphs and graphs on surfaces
- Six-Critical Graphs on the Klein Bottle
- Extensions of fractional precolorings show discontinuous behavior
- Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph
- Adjacency graphs of polyhedral surfaces
- Extending graph colorings
- Extended Gallai's theorem
- On list-coloring outerplanar graphs
- Coloring parameters for graphs on surfaces
- Circular choosability
- Coloring Triangle-Free Graphs on Surfaces
- Extension from precoloured sets of edges
- Coloring graphs with fixed genus and girth
- Choosability of toroidal graphs without short cycles
- Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk.
- 5-list-coloring planar graphs with distant precolored vertices
- Beyond degree choosability
- A note on traversing specified vertices in graphs embedded with large representativity
- The orientable genus of the join of a cycle and a complete graph
- Linear connectivity forces large complete bipartite minors
- Critically paintable, choosable or colorable graphs
- Exponentially many 5-list-colorings of planar graphs
- 5-list coloring toroidal 6-regular triangulations in linear time
- Locally planar graphs are 5-choosable
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
- Extending colorings of planar graphs
- Randomly colouring graphs (a combinatorial view)
- Coloring-flow duality of embedded graphs
- Five-coloring graphs on the Klein bottle
- Distance constraints in graph color extensions
- Coloring face-hypergraphs of graphs on surfaces
- Long cycles in graphs on a fixed surface
- A theorem on paths in locally planar triangulations
- Some recent progress and applications in graph minor theory
- Dirac's map-color theorem for choosability
- The chromatic number of a graph of girth 5 on a fixed surface
- Extending precolorings of subgraphs of locally planar graphs
- Finite dualities and map-critical graphs on a fixed surface
- Three-coloring Klein bottle graphs of girth five
- The number of colorings of planar graphs with no separating triangles
- Title not available (Why is that?)
- Colouring graphs on surfaces
- Generalized DP-colorings of graphs
- Decomposing a planar graph into an independent set and a 3-degenerate graph
- 4-critical graphs on surfaces without contractible \((\leq 4)\)-cycles
- On an adjacency property of almost all tournaments
- List precoloring extension in planar graphs
- The colour theorems of Brooks and Gallai extended
- Some remarks on Hajós' conjecture
- Spanning quadrangulations of triangulated surfaces
- On the dichromatic number of surfaces
- The number of \(k\)-colorings of a graph on a fixed surface
- Many 3-colorings of triangle-free planar graphs
- A Five-Color Theorem for Graphs on Surfaces
- Extending colorings of locally planar graphs
- You can't paint yourself into a corner
- Extending precolourings of circular cliques
- Supersaturation problem for color-critical graphs
- Extending precolorings to circular colorings
- 7-critical graphs of bounded genus
- List-coloring graphs without subdivisions and without immersions
- Hyperbolic families and coloring graphs on surfaces
This page was built for publication: Color-critical graphs on a fixed surface
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369650)
