Pages that link to "Item:Q397076"
From MaRDI portal
The following pages link to Ore's conjecture for \(k=4\) and Grötzsch's theorem (Q397076):
Displayed 23 items.
- I,F-partitions of sparse graphs (Q298327) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Characterizing 4-critical graphs with Ore-degree at most seven (Q684124) (← links)
- Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk (Q723878) (← links)
- Density of 5/2-critical graphs (Q1705839) (← links)
- A Brooks-type result for sparse critical graphs (Q1786052) (← links)
- Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs (Q2040021) (← links)
- Counting critical subgraphs in \(k\)-critical graphs (Q2064752) (← links)
- Density of \(C_{-4}\)-critical signed graphs (Q2072181) (← links)
- Further extensions of the Grötzsch theorem (Q2124638) (← links)
- The minimum number of edges in 4-critical digraphs of given order (Q2175801) (← links)
- The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges (Q2255804) (← links)
- Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728) (← links)
- On the minimum number of edges in triangle-free 5-critical graphs (Q2403700) (← links)
- A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains (Q3177443) (← links)
- A density bound for triangle‐free 4‐critical graphs (Q6047637) (← links)
- (Q6072056) (← links)
- Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$ (Q6081578) (← links)
- Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph (Q6117430) (← links)
- Homomorphisms to small negative even cycles (Q6201924) (← links)