4-chromatic projective graphs
From MaRDI portal
Recommendations
- 4-chromatic Koester graphs
- Internally 4-connected projective-planar graphs
- Quadrangulations and 4-color-critical graphs
- 4-chromatic edge critical Grötzsch-Sachs graphs
- 4-chromatic graphs with large odd girth
- Triangle-free four-chromatic graphs
- A class of edge critical 4-chromatic graphs
- Schrijver graphs and projective quadrangulations
- scientific article; zbMATH DE number 841645
- scientific article; zbMATH DE number 1014829
Cited in
(46)- On the minimal number of edges in color-critical graphs
- On facial unique-maximum (edge-)coloring
- Quadrangulations and 4-color-critical graphs
- High-girth graphs avoiding a minor are nearly bipartite
- Colouring Eulerian triangulations
- Coloring locally bipartite graphs on surfaces.
- Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces
- Three-coloring Klein bottle graphs of girth five
- Coloring Eulerian triangulations of the Klein bottle
- Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)
- Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five
- On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges
- On inverse powers of graphs and topological implications of Hedetniemi's conjecture
- Colouring quadrangulations of projective spaces
- 5-chromatic even triangulations on surfaces
- Local chromatic number of quadrangulations of surfaces
- Short proofs of coloring theorems on planar graphs
- 5-chromatic even triangulations on the Klein bottle
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
- Chromatic numbers of quadrangulations on closed surfaces
- Small odd cycles in 4-chromatic graphs
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
- Circular flows of nearly Eulerian graphs and vertex-splitting
- Local chromatic number and distinguishing the strength of topological obstructions
- Coloring graphs with fixed genus and girth
- On graphs with strongly independent color-classes
- A Complexity Dichotomy for the Coloring of Sparse Graphs
- scientific article; zbMATH DE number 7145382 (Why is no real title available?)
- Fractional coloring methods with applications to degenerate graphs and graphs on surfaces
- Coloring-flow duality of embedded graphs
- scientific article; zbMATH DE number 2230307 (Why is no real title available?)
- Graphs with bounded tree-width and large odd-girth are almost bipartite
- A density bound for triangle‐free 4‐critical graphs
- Nowhere-zero 3-flows in signed planar graphs
- Coloring zonotopal quadrangulations of the projective space
- Precoloring extension in planar near-Eulerian-triangulations
- Precoloring extension in planar near-Eulerian-triangulations
- Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
- Precoloring extension in planar near-Eulerian-triangulations (extended abstract)
- What is on his mind?
- Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
- Abelian groups without 3-chromatic Cayley graphs
- Higher-dimensional generalization of Youngs' theorem and circular colorings
- Quadrangulations on 3-colored point sets with Steiner points and their winding numbers
- 3-colorable even embeddings on closed surfaces
- Coloring even-faced graphs in the torus and the Klein bottle
This page was built for publication: 4-chromatic projective graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4865530)
