Pages that link to "Item:Q913807"
From MaRDI portal
The following pages link to Forbidden minors characterization of partial 3-trees (Q913807):
Displaying 45 items.
- Characterizing width two for variants of treewidth (Q344827) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Bounding tree-width via contraction on the projective plane and torus (Q888611) (← links)
- On two dual classes of planar graphs (Q916681) (← links)
- Three-connected graphs whose maximum nullity is at most three (Q929488) (← links)
- A characterization of some graph classes using excluded minors (Q950291) (← links)
- Recognizing digraphs of Kelly-width 2 (Q972333) (← links)
- Structure and recognition of graphs with no 6-wheel subdivision (Q1031873) (← links)
- Simplicial decompositions of graphs: A survey of applications (Q1118617) (← 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)
- A note on partial 3-trees and homomorphism bases of graphs (Q1313444) (← links)
- Minors of quasi 4-connected graphs (Q1318814) (← links)
- Minimal acyclic forbidden minors for the family of graphs with bounded path-width (Q1322236) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- On 3-cutwidth critical graphs (Q1420615) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- The structure of obstructions to treewidth and pathwidth (Q1613365) (← links)
- On the critical densities of minor-closed classes (Q1621066) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- Treewidth distance on phylogenetic trees (Q1637220) (← links)
- On compatibility and incompatibility of collections of unrooted phylogenetic trees (Q1752481) (← links)
- Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
- Minor obstructions for apex-pseudoforests (Q2043398) (← links)
- On the treewidth of Hanoi graphs (Q2077387) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees (Q2200916) (← links)
- A new graph parameter related to bounded rank positive semidefinite matrix completions (Q2248754) (← links)
- Treewidth, crushing and hyperbolic volume (Q2279065) (← links)
- Gallai's conjecture for graphs with treewidth 3 (Q2413163) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- On strict brambles (Q2689118) (← links)
- Forbidding Kuratowski Graphs as Immersions (Q2940987) (← links)
- Mineurs d'arbres avec racines (Q4858839) (← links)
- (Q5005163) (← links)
- Properties of Large 2-Crossing-Critical Graphs (Q5084710) (← links)
- Characterising graphs with no subdivision of a wheel of bounded diameter (Q6038576) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- All longest cycles in a 2‐connected partial 3‐tree share a common vertex (Q6047958) (← links)
- Packing Signatures in Signed Graphs (Q6057805) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
- Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings (Q6081567) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
