4-chromatic projective graphs
From MaRDI portal
Publication:4865530
DOI10.1002/(SICI)1097-0118(199602)21:2%3C219::AID-JGT12%3E3.0.CO;2-EzbMATH Open0839.05040OpenAlexW2043731122MaRDI QIDQ4865530FDOQ4865530
Authors: D. A. Youngs 
Publication date: 25 February 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2%3C219::aid-jgt12%3E3.0.co;2-e
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
- Publication:4863497
- scientific article; zbMATH DE number 1014829
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (41)
- 3-colorable even embeddings on closed surfaces
- Colouring quadrangulations of projective spaces
- Local chromatic number of quadrangulations of surfaces
- Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces
- On graphs with strongly independent color-classes
- Coloring graphs with fixed genus and girth
- Nowhere-zero 3-flows in signed planar graphs
- Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
- Coloring-flow duality of embedded graphs
- Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five
- Quadrangulations and 4-color-critical graphs
- Fractional coloring methods with applications to degenerate graphs and graphs on surfaces
- Colouring Eulerian triangulations
- Graphs with bounded tree-width and large odd-girth are almost bipartite
- Quadrangulations on 3-colored point sets with Steiner points and their winding numbers
- On inverse powers of graphs and topological implications of Hedetniemi's conjecture
- Coloring Eulerian triangulations of the Klein bottle
- Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)
- 5-chromatic even triangulations on surfaces
- 5-chromatic even triangulations on the Klein bottle
- Circular flows of nearly Eulerian graphs and vertex-splitting
- A density bound for triangle‐free 4‐critical graphs
- Three-coloring Klein bottle graphs of girth five
- On the minimal number of edges in color-critical graphs
- Title not available (Why is that?)
- What is on his mind?
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
- Small odd cycles in 4-chromatic graphs
- High-girth graphs avoiding a minor are nearly bipartite
- Coloring locally bipartite graphs on surfaces.
- On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges
- Irreducible 4-critical triangle-free toroidal graphs
- Coloring zonotopal quadrangulations of the projective space
- Chromatic numbers of quadrangulations on closed surfaces
- On facial unique-maximum (edge-)coloring
- A Complexity Dichotomy for the Coloring of Sparse Graphs
- Local chromatic number and distinguishing the strength of topological obstructions
- Short proofs of coloring theorems on planar graphs
- Title not available (Why is that?)
- 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)
