Color-critical graphs on a fixed surface
From MaRDI portal
Publication:1369650
DOI10.1006/jctb.1996.1722zbMath0883.05051OpenAlexW1978313715MaRDI 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
Related Items
On the dichromatic number of surfaces, Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk., Three-coloring Klein bottle graphs of girth five, A theorem on paths in locally planar triangulations, Extending precolorings of subgraphs of locally planar graphs, Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle., Six-Critical Graphs on the Klein Bottle, The colour theorems of Brooks and Gallai extended, The number of \(k\)-colorings of a graph on a fixed surface, Hyperbolic families and coloring graphs on surfaces, 5-list-coloring planar graphs with distant precolored vertices, The number of colorings of planar graphs with no separating triangles, Extension from precoloured sets of edges, Extensions of Fractional Precolorings Show Discontinuous Behavior, Beyond degree choosability, Many 3-colorings of triangle-free planar graphs, Extending colorings of locally planar graphs, Some recent progress and applications in graph minor theory, Distance constraints in graph color extensions, Exponentially many 5-list-colorings of planar graphs, 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle, Spanning quadrangulations of triangulated surfaces, Generalized DP-colorings of graphs, Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph, 5-list coloring toroidal 6-regular triangulations in linear time, The chromatic number of a graph of girth 5 on a fixed surface, On an adjacency property of almost all tournaments, On list-coloring outerplanar graphs, Dirac's map-color theorem for choosability, Randomly colouring graphs (a combinatorial view), Extending precolourings of circular cliques, Coloring Triangle-Free Graphs on Surfaces, Coloring graphs with fixed genus and girth, Locally planar graphs are 5-choosable, List precoloring extension in planar graphs, Some remarks on Hajós' conjecture, A note on traversing specified vertices in graphs embedded with large representativity, Extending precolorings to circular colorings, Critically paintable, choosable or colorable graphs, Five-coloring graphs on the Klein bottle, Choosability of toroidal graphs without short cycles, Irreducible 4-critical triangle-free toroidal graphs, Coloring-flow duality of embedded graphs, The orientable genus of the join of a cycle and a complete graph, You can't paint yourself into a corner, Linear connectivity forces large complete bipartite minors, Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces, Finite dualities and map-critical graphs on a fixed surface, Extending graph colorings, Circular choosability, Extended Gallai's Theorem, Extending colorings of planar graphs, Some of My Favorite Coloring Problems for Graphs and Digraphs, Decomposing a planar graph into an independent set and a 3-degenerate graph, Coloring face-hypergraphs of graphs on surfaces, Long cycles in graphs on a fixed surface, Unnamed Item
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
