4-chromatic projective graphs

From MaRDI portal
Publication:4865530

DOI<219::AID-JGT12>3.0.CO;2-E 10.1002/(SICI)1097-0118(199602)21:2<219::AID-JGT12>3.0.CO;2-EzbMath0839.05040OpenAlexW2043731122MaRDI QIDQ4865530

D. A. Youngs

Publication date: 25 February 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2<219::aid-jgt12>3.0.co;2-e



Related Items

Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces, Three-coloring Klein bottle graphs of girth five, Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle., Unnamed Item, Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\), Graphs with bounded tree-width and large odd-girth are almost bipartite, 3-colorable even embeddings on closed surfaces, Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm, Coloring Eulerian triangulations of the Klein bottle, A density bound for triangle‐free 4‐critical graphs, 5-chromatic even triangulations on surfaces, Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five, On facial unique-maximum (edge-)coloring, Local chromatic number of quadrangulations of surfaces, Short proofs of coloring theorems on planar graphs, On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges, Coloring graphs with fixed genus and girth, Coloring even-faced graphs in the torus and the Klein bottle, Chromatic numbers of quadrangulations on closed surfaces, Small odd cycles in 4-chromatic graphs, A Complexity Dichotomy for the Coloring of Sparse Graphs, What is on his mind?, Irreducible 4-critical triangle-free toroidal graphs, Local chromatic number and distinguishing the strength of topological obstructions, Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk, Coloring-flow duality of embedded graphs, Quadrangulations on 3-colored point sets with Steiner points and their winding numbers, On the minimal number of edges in color-critical graphs, Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces, Unnamed Item, Quadrangulations and 4-color-critical graphs, On graphs with strongly independent color-classes, On inverse powers of graphs and topological implications of Hedetniemi's conjecture, High-girth graphs avoiding a minor are nearly bipartite, Colouring Eulerian triangulations, Coloring locally bipartite graphs on surfaces., 5-chromatic even triangulations on the Klein bottle, Colouring quadrangulations of projective spaces, Circular flows of nearly Eulerian graphs and vertex-splitting