Pages that link to "Item:Q1362099"
From MaRDI portal
The following pages link to A simpler proof of the excluded minor theorem for higher surfaces (Q1362099):
Displaying 13 items.
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Highly connected sets and the excluded grid theorem (Q1306423) (← links)
- Branch-width and Rota's conjecture (Q1403924) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Branch-width and well-quasi-ordering in matroids and graphs. (Q1850591) (← links)
- Embedding grids in surfaces (Q1883290) (← links)
- Computing crossing numbers in quadratic time (Q1887712) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs (Q4933601) (← links)
