Pages that link to "Item:Q712277"
From MaRDI portal
The following pages link to Brooks' theorem via the Alon-Tarsi theorem (Q712277):
Displayed 17 items.
- The tournament scheduling problem with absences (Q323410) (← links)
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- Critically paintable, choosable or colorable graphs (Q713164) (← links)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- Dynamic coloring parameters for graphs with given genus (Q1682887) (← links)
- On a Lovász-type lemma, applied to Brooks' theorem for list-colouring (Q2275459) (← links)
- Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728) (← links)
- Beyond degree choosability (Q2401410) (← links)
- Strengthening \((a,b)\)-choosability results to \((a,b)\)-paintability (Q2411512) (← links)
- The list-chromatic index of \(K_6\) (Q2436826) (← links)
- Brooks' theorem on powers of graphs (Q2449134) (← links)
- Partial Online List Coloring of Graphs (Q2862550) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- List-Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5346550) (← links)