Pages that link to "Item:Q462926"
From MaRDI portal
The following pages link to Ore's conjecture on color-critical graphs is almost true (Q462926):
Displaying 34 items.
- I,F-partitions of sparse graphs (Q298327) (← links)
- A better lower bound on average degree of 4-list-critical graphs (Q311559) (← links)
- On the minimum edge-density of 5-critical triangle-free graphs (Q322349) (← links)
- The edge density of critical digraphs (Q519953) (← links)
- Characterizing 4-critical graphs with Ore-degree at most seven (Q684124) (← links)
- Adynamic coloring of graphs (Q777385) (← links)
- Critical \((P_6, \mathrm{banner})\)-free graphs (Q1732108) (← links)
- A better lower bound on average degree of online \(k\)-list-critical graphs (Q1753017) (← links)
- A Brooks-type result for sparse critical graphs (Q1786052) (← links)
- On 3-flow-critical graphs (Q2065125) (← links)
- Density of \(C_{-4}\)-critical signed graphs (Q2072181) (← links)
- Point partition numbers: decomposable and indecomposable critical graphs (Q2142640) (← links)
- On the density of \(C_7\)-critical graphs (Q2151187) (← links)
- Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) (Q2161276) (← 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)
- Tools for counting odd cycles in graphs (Q2338636) (← 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)
- Structure in sparse \(k\)-critical graphs (Q2673484) (← links)
- Large cliques and independent sets all over the place (Q4992901) (← links)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- A local epsilon version of Reed's conjecture (Q5919302) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5925505) (← links)
- A density bound for triangle‐free 4‐critical graphs (Q6047637) (← links)
- (Q6072056) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
- On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs (Q6098458) (← links)
- Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph (Q6117430) (← links)
- Some results on \(k\)-critical \(P_5\)-free graphs (Q6157421) (← links)
- Homomorphisms to small negative even cycles (Q6201924) (← links)