Pages that link to "Item:Q1410731"
From MaRDI portal
The following pages link to Graph minors. XVI: Excluding a non-planar graph (Q1410731):
Displaying 50 items.
- Minors and dimension (Q345115) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- The Erdős-Pósa property for clique minors in highly connected graphs (Q412171) (← links)
- Classes of graphs with small rank decompositions are \(\chi \)-bounded (Q412260) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Catalan structures and dynamic programming in \(H\)-minor-free graphs (Q440008) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- Implicit branching and parameterized partial cover problems (Q657922) (← links)
- A new proof of the flat wall theorem (Q684127) (← links)
- Excluding a large theta graph (Q723880) (← links)
- Explicit bounds for graph minors (Q723881) (← links)
- Finding cactus roots in polynomial time (Q726100) (← links)
- Covering nearly surface-embedded graphs with a fixed number of balls (Q741614) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- 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)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- Excluding subdivisions of bounded degree graphs (Q1633742) (← links)
- Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← 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)
- On the excluded minor structure theorem for graphs of large tree-width (Q1931397) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- Additive non-approximability of chromatic number in proper minor-closed classes (Q2099409) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- Tangle-tree duality in abstract separation systems (Q2217534) (← links)
- Four-searchable biconnected outerplanar graphs (Q2243137) (← links)
- Sparse covers for planar graphs and graphs that exclude a fixed minor (Q2249746) (← links)
