Pages that link to "Item:Q1311018"
From MaRDI portal
The following pages link to Hadwiger's conjecture for \(K_ 6\)-free graphs (Q1311018):
Displaying 50 items.
- Rooted topological minors on four vertices (Q2099413) (← links)
- Immersion and clustered coloring (Q2099417) (← 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)
- Some remarks on even-hole-free graphs (Q2161221) (← links)
- Clique immersion in graphs without a fixed bipartite graph (Q2171024) (← links)
- All minor-minimal apex obstructions with connectivity two (Q2223478) (← links)
- In memoriam: Professor Robin Thomas (1962--2020) (Q2227969) (← links)
- Maximal ambiguously \(k\)-colorable graphs (Q2284731) (← links)
- A note on the Hadwiger number of circular arc graphs (Q2379986) (← links)
- A special case of Hadwiger's conjecture (Q2384811) (← links)
- Coloring graphs with forbidden minors (Q2407377) (← links)
- \(K_{6}\) minors in 6-connected graphs of bounded tree-width (Q2421546) (← links)
- Sketchy tweets: ten minute conjectures in graph theory (Q2429454) (← links)
- Fractional coloring and the odd Hadwiger's conjecture (Q2472835) (← links)
- The extremal function for \(K_{9}\) minors (Q2490252) (← links)
- Reducing Hajós' 4-coloring conjecture to 4-connected graphs (Q2496200) (← links)
- On the odd-minor variant of Hadwiger's conjecture (Q2519011) (← links)
- The extremal function for \(K_{8}^{-}\) minors (Q2573648) (← links)
- Linking four vertices in graphs of large connectivity (Q2668016) (← links)
- Phase transition of degeneracy in minor-closed families (Q2689167) (← links)
- Optimal connectivity for fat-triangle linkages (Q2689492) (← 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)
- Hadwiger’s Conjecture and Squares of Chordal Graphs (Q2817883) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- Constructing Graphs with No Immersion of Large Complete Graphs (Q2922213) (← links)
- Hadwiger's Conjecture for the Complements of Kneser Graphs (Q2958193) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- Hadwiger's Conjecture for ℓ‐Link Graphs (Q2978185) (← links)
- PARTIAL RESULT ON HADWIGER'S CONJECTURE (Q3063611) (← links)
- On Vertex Partitions and the Colin de Verdière Parameter (Q3439630) (← links)
- A Relative of Hadwiger's Conjecture (Q3461983) (← links)
- Finite duality for some minor closed classes (Q3503522) (← links)
- Random Graphs from a Minor-Closed Class (Q3552514) (← links)
- A Weakening of the Odd Hadwiger's Conjecture (Q3608337) (← links)
- THE CLIQUE MINOR OF GRAPHS WITH INDEPENDENCE NUMBER TWO (Q3634209) (← links)
- Minors in Graphs with High Chromatic Number (Q5199505) (← links)
- Improper colouring of graphs with no odd clique minor (Q5222552) (← links)
- Finding Minors in Graphs with a Given Path Structure (Q5251199) (← links)
- Unique Colorability and Clique Minors (Q5272642) (← links)
- Hadwiger's Conjecture for Graphs with Forbidden Holes (Q5348213) (← links)
- Some Conjectures and Questions in Chromatic Topological Graph Theory (Q5506783) (← links)
- (Q5743487) (← links)
- Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
- Improved bound for improper colourings of graphs with no odd clique minor (Q5885199) (← links)
- Strong complete minors in digraphs (Q5886331) (← links)
- Improved lower bound for the list chromatic number of graphs with no <i>K<sub>t</sub></i> minor (Q5886353) (← links)
- Forcing clique immersions through chromatic number (Q5892297) (← links)
