Pages that link to "Item:Q1026000"
From MaRDI portal
The following pages link to Linear connectivity forces large complete bipartite minors (Q1026000):
Displayed 15 items.
- Contractibility and the Hadwiger conjecture (Q710728) (← links)
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture (Q858685) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- A relaxed Hadwiger's conjecture for list colorings (Q885300) (← links)
- Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
- Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density (Q1011746) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Note on coloring graphs without odd-\(K_k\)-minors (Q1026013) (← links)
- List-coloring graphs without \(K_{4,k}\)-minors (Q1028458) (← links)
- Rooted minor problems in highly connected graphs (Q1886348) (← links)
- Disjoint complete minors and bipartite minors (Q2372437) (← links)
- The extremal function for \(K_{9}\) minors (Q2490252) (← links)
- Non-zero disjoint cycles in highly connected group labelled graphs (Q2490257) (← links)
- Extremal connectivity for topological cliques in bipartite graphs (Q2581501) (← links)
- Extremal results for rooted minor problems (Q5295498) (← links)