Pages that link to "Item:Q3728922"

The following pages link to Characterization and Recognition of Partial 3-Trees (Q3728922):

Displaying 37 items.

• Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
• Treewidth computations. II. Lower bounds (Q549673) (← links)
• Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
• Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
• Efficient sets in partial \(k\)-trees (Q686252) (← links)
• Safe separators for treewidth (Q819825) (← links)
• Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
• Forbidden minors characterization of partial 3-trees (Q913807) (← links)
• On two dual classes of planar graphs (Q916681) (← links)
• Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
• Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
• Steiner problem in Halin networks (Q1092013) (← links)
• Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← links)
• Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
• An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree (Q1205700) (← links)
• Complexity of path-forming games (Q1210546) (← 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)
• On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
• Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
• The nonexistence of reduction rules giving an embedding into a \(k\)-tree (Q1336627) (← links)
• Regularity and locality in \(k\)-terminal graphs (Q1336630) (← links)
• Tree-width, clique-minors, and eigenvalues. (Q1421528) (← links)
• Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
• Generating internally four-connected graphs (Q1850601) (← links)
• Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
• An improved planar graph product structure theorem (Q2152790) (← links)
• The tree-width of C (Q2174562) (← links)
• Characterizing graphs of small carving-width (Q2446832) (← links)
• Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
• Characterizations of H-graphs (Q2795961) (← links)
• A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q2830211) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• (Q5005163) (← links)
• Heuristic and metaheuristic methods for computing graph treewidth (Q5479837) (← links)