Pages that link to "Item:Q1079583"
From MaRDI portal
The following pages link to Graph minors. V. Excluding a planar graph (Q1079583):
Displaying 50 items.
- Graph operations characterizing rank-width (Q1028455) (← links)
- A Menger-like property of tree-width: The finite case (Q1097894) (← links)
- Grids and their minors (Q1097897) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- Graph minors. X: Obstructions to tree-decomposition (Q1179473) (← links)
- Decomposing infinite graphs (Q1191914) (← links)
- Excluding infinite minors (Q1191928) (← links)
- Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Highly connected sets and the excluded grid theorem (Q1306423) (← links)
- Obstruction set isolation for the gate matrix layout problem (Q1336625) (← links)
- Quickly excluding a planar graph (Q1338321) (← links)
- On search, decision, and the efficiency of polynomial-time algorithms (Q1342869) (← links)
- A simpler proof of the excluded minor theorem for higher surfaces (Q1362099) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- Graph minors. XVI: Excluding a non-planar graph (Q1410731) (← links)
- Clique-width of countable graphs: A compactness property. (Q1422417) (← links)
- Induced and weak induced arboricities (Q1625812) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Excluding a full grid minor (Q1688263) (← links)
- \(K_4\)-expansions have the edge-Erdős-Pósa property (Q1689905) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- A note on immersion minors and planarity (Q1744743) (← links)
- A unified treatment of linked and lean tree-decompositions (Q1745735) (← links)
- The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs (Q1748270) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- Graph minor hierarchies (Q1764803) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- On the structure of matrices avoiding interval-minor patterns (Q1795489) (← links)
- Clique-sums, tree-decompositions and compactness (Q1813735) (← links)
- Excluding any graph as a minor allows a low tree-width 2-coloring (Q1826951) (← links)
- The monadic second-order logic of graphs. VIII: Orientations (Q1842126) (← links)
- Directed tree-width (Q1850539) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Computing crossing numbers in quadratic time (Q1887712) (← links)
- On tree-partitions of graphs (Q1910567) (← links)
- On the excluded minor structure theorem for graphs of large tree-width (Q1931397) (← links)
- Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- On the tree-width of even-hole-free graphs (Q1979431) (← links)
- Packing and covering immersions in 4-edge-connected graphs (Q1984514) (← links)
- A Menger-like property of tree-cut width (Q1998754) (← links)
- Reducing graph transversals via edge contractions (Q2037191) (← links)
- Fractal dimension and lower bounds for geometric problems (Q2039303) (← links)
- Unavoidable minors for graphs with large \(\ell_p\)-dimension (Q2039320) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- On tseitin formulas, read-once branching programs and treewidth (Q2043884) (← links)
