The following pages link to Hadwiger’s Conjecture (Q2827298):
Displaying 32 items.
- Average degree conditions forcing a minor (Q259170) (← links)
- Hadwiger's conjecture for 3-arc graphs (Q727197) (← links)
- Rooted complete minors in line graphs with a Kempe coloring (Q1741595) (← links)
- The extremal function for Petersen minors (Q1748273) (← links)
- The extremal function and Colin de Verdière graph parameter (Q1753124) (← links)
- Clique immersions in graphs of independence number two with certain forbidden subgraphs (Q2022152) (← links)
- Notes on tree- and path-chromatic number (Q2058953) (← links)
- Odd Hadwiger for line-graphs (Q2092424) (← 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)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor (Q2151177) (← links)
- Disproof of a conjecture by Woodall on the choosability of \(K_{s,t}\)-minor-free graphs (Q2153396) (← links)
- Some remarks on even-hole-free graphs (Q2161221) (← links)
- On the Hadwiger number of Kneser graphs and their random subgraphs (Q2278635) (← links)
- Maximal ambiguously \(k\)-colorable graphs (Q2284731) (← links)
- A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two (Q2329179) (← links)
- Coloring graphs with forbidden minors (Q2407377) (← links)
- Clustered variants of Hajós' conjecture (Q2664549) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor (Q2700634) (← links)
- Properties of 8-contraction-critical graphs with no \(K_7\) minor (Q2701012) (← links)
- Improper colouring of graphs with no odd clique minor (Q5222552) (← links)
- Hadwiger's Conjecture for Graphs with Forbidden Holes (Q5348213) (← links)
- Extremal functions for sparse minors (Q5871274) (← links)
- Improved bound for improper colourings of graphs with no odd clique minor (Q5885199) (← links)
- Improved lower bound for the list chromatic number of graphs with no <i>K<sub>t</sub></i> minor (Q5886353) (← links)
- Complete directed minors and chromatic number (Q6046643) (← links)
- Clique minors in graphs with a forbidden subgraph (Q6074687) (← links)
- Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs (Q6144390) (← links)
- Refined List Version of Hadwiger’s Conjecture (Q6171265) (← links)
- Recent progress towards Hadwiger's conjecture (Q6198638) (← links)
