Pages that link to "Item:Q1786052"
From MaRDI portal
The following pages link to A Brooks-type result for sparse critical graphs (Q1786052):
Displaying 33 items.
- On the minimum edge-density of 5-critical triangle-free graphs (Q322349) (← links)
- Strong edge coloring sparse graphs (Q324370) (← links)
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- On pallets for Fox colorings of spatial graphs (Q409573) (← links)
- Linear coloring of sparse graphs (Q412383) (← links)
- Characterizing 4-critical graphs with Ore-degree at most seven (Q684124) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- Adynamic coloring of graphs (Q777385) (← links)
- On a conjecture of Gallai concerning complete subgraphs of \(k\)-critical graphs (Q1198644) (← links)
- Dense critical and vertex-critical graphs (Q1850041) (← links)
- Sparse \(H\)-colourable graphs of bounded maximum degree (Q1889843) (← links)
- Counting critical subgraphs in \(k\)-critical graphs (Q2064752) (← links)
- On 3-flow-critical graphs (Q2065125) (← links)
- Further extensions of the Grötzsch theorem (Q2124638) (← links)
- Critical graphs for the chromatic edge-stability number (Q2174589) (← links)
- On the minimum number of edges in triangle-free 5-critical graphs (Q2403700) (← links)
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363) (← links)
- Restricted extension of sparse partial edge colorings of complete graphs (Q2662349) (← links)
- Structure in sparse \(k\)-critical graphs (Q2673484) (← links)
- \(k\)-forested coloring of sparse graphs (Q2886271) (← links)
- 2-Distance Coloring of Sparse Graphs (Q2930038) (← links)
- Maximum Weight Partial Colorings on Sparse Random Graphs (Q3094951) (← links)
- The small stellated dodecahedron code and friends (Q4561770) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
- (Q4928488) (redirect page) (← links)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
- Hajós-Type Constructions and Neighborhood Complexes (Q5139660) (← links)
- (Q5387670) (← links)
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits (Q5886111) (← links)
- A GRASP for coloring sparse graphs (Q5938473) (← links)
- A density bound for triangle‐free 4‐critical graphs (Q6047637) (← links)
- On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs (Q6098458) (← links)
- On the minimum number of arcs in 4-dicritical oriented graphs (Q6657587) (← links)
