Pages that link to "Item:Q2700634"
From MaRDI portal
The following pages link to Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor (Q2700634):
Displaying 21 items.
- Note on coloring graphs without odd-\(K_k\)-minors (Q1026013) (← links)
- Excluding any graph as a minor allows a low tree-width 2-coloring (Q1826951) (← links)
- Immersion and clustered coloring (Q2099417) (← links)
- Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418) (← links)
- Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant (Q2131858) (← links)
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor (Q2151177) (← links)
- Coloring graphs with forbidden minors (Q2407377) (← links)
- Fractional coloring and the odd Hadwiger's conjecture (Q2472835) (← links)
- Phase transition of degeneracy in minor-closed families (Q2689167) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- On Ks,t minors in (s+t)-chromatic graphs (Q3061193) (← links)
- Graphs with no K9= minor are 10‐colorable (Q5110672) (← links)
- (Q5417628) (← links)
- Improved lower bound for the list chromatic number of graphs with no <i>K<sub>t</sub></i> minor (Q5886353) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
- Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs (Q6144390) (← links)
- Local Hadwiger's conjecture (Q6170795) (← links)
- Refined List Version of Hadwiger’s Conjecture (Q6171265) (← links)
- Breaking the degeneracy barrier for coloring graphs with no $K_t$ minor (Q6327595) (← links)
- Hadwiger's conjecture and topological bounds (Q6612303) (← links)
- On the choosability of \(H\)-minor-free graphs (Q6632798) (← links)
