Pages that link to "Item:Q1410731"
From MaRDI portal
The following pages link to Graph minors. XVI: Excluding a non-planar graph (Q1410731):
Displayed 28 items.
- Graph minors. III. Planar tree-width (Q799684) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Some open problems on excluding a uniform matroid (Q953908) (← links)
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Graph minors. XXI. graphs with unique linkages (Q1026001) (← links)
- Tangles, tree-decompositions and grids in matroids (Q1026005) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- Graph minors. I. Excluding a forest (Q1055450) (← links)
- Grids and their minors (Q1097897) (← links)
- Graph minors. X: Obstructions to tree-decomposition (Q1179473) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Excluding a countable clique (Q1305523) (← links)
- Graph minors. XVII: Taming a vortex (Q1569044) (← links)
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor (Q1767621) (← links)
- Excluding any graph as a minor allows a low tree-width 2-coloring (Q1826951) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) (← links)
- Excluding a group-labelled graph (Q2519025) (← links)
- Graph minor theory (Q3372389) (← links)
- The Grad of a Graph and Classes with Bounded Expansion (Q3439315) (← links)
- Fraternal Augmentations of graphs, Coloration and Minors (Q3439588) (← links)
- An Improved Algorithm for Finding Cycles Through Elements (Q3503860) (← links)
- Circle graph obstructions under pivoting (Q3633003) (← links)
- Forcing a <i>K<sub>r</sub></i> minor by high external connectivity (Q4537560) (← links)
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes (Q5302069) (← links)
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time (Q5458529) (← links)
