The following pages link to 4-chromatic projective graphs (Q4865530):
Displaying 39 items.
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711) (← links)
- What is on his mind? (Q709300) (← links)
- Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk (Q723878) (← links)
- Quadrangulations on 3-colored point sets with Steiner points and their winding numbers (Q742636) (← links)
- 3-colorable even embeddings on closed surfaces (Q878057) (← links)
- Coloring even-faced graphs in the torus and the Klein bottle (Q949800) (← links)
- On the minimal number of edges in color-critical graphs (Q1272188) (← links)
- On facial unique-maximum (edge-)coloring (Q1701086) (← links)
- Quadrangulations and 4-color-critical graphs (Q1826961) (← links)
- High-girth graphs avoiding a minor are nearly bipartite (Q1850553) (← links)
- Colouring Eulerian triangulations (Q1850587) (← links)
- Coloring locally bipartite graphs on surfaces. (Q1850593) (← links)
- Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces (Q1877664) (← links)
- Three-coloring Klein bottle graphs of girth five (Q1880794) (← links)
- Coloring Eulerian triangulations of the Klein bottle (Q1926035) (← links)
- Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) (Q2161276) (← links)
- Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five (Q2200929) (← links)
- On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges (Q2220978) (← links)
- On inverse powers of graphs and topological implications of Hedetniemi's conjecture (Q2338641) (← links)
- Colouring quadrangulations of projective spaces (Q2347842) (← links)
- 5-chromatic even triangulations on surfaces (Q2427515) (← links)
- Local chromatic number of quadrangulations of surfaces (Q2439834) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- 5-chromatic even triangulations on the Klein bottle (Q2576860) (← links)
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm (Q2664564) (← links)
- Chromatic numbers of quadrangulations on closed surfaces (Q2744570) (← links)
- Small odd cycles in 4-chromatic graphs (Q2744571) (← links)
- Circular flows of nearly Eulerian graphs and vertex-splitting (Q3150192) (← links)
- Local chromatic number and distinguishing the strength of topological obstructions (Q3605849) (← links)
- Coloring graphs with fixed genus and girth (Q4372592) (← links)
- On graphs with strongly independent color-classes (Q4736765) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
- (Q5206906) (← links)
- Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces (Q5232160) (← links)
- Coloring-flow duality of embedded graphs (Q5461372) (← links)
- (Q5708603) (← links)
- Irreducible 4-critical triangle-free toroidal graphs (Q5915812) (← links)
- A density bound for triangle‐free 4‐critical graphs (Q6047637) (← links)
