Pages that link to "Item:Q1405127"
From MaRDI portal
The following pages link to A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127):
Displayed 15 items.
- A better lower bound on average degree of 4-list-critical graphs (Q311559) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- The edge density of critical digraphs (Q519953) (← links)
- On the edge-density of 4-critical graphs (Q624211) (← links)
- Coloring vertices and faces of locally planar graphs (Q855294) (← links)
- On list critical graphs (Q1044925) (← 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)
- Generalized hypergraph coloring (Q2214310) (← links)
- Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728) (← links)
- On the critical point-arboricity graphs (Q2778282) (← links)
- A list version of Dirac's theorem on the number of edges in colour-critical graphs (Q3651176) (← links)
- ON LOCALLY-BALANCED 2-PARTITIONS OF BIPARTITE GRAPHS (Q5100156) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
- On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs (Q6098458) (← links)