Graph minors. III. Planar tree-width
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Backdoors to tractable answer set programming
- On the complexity of planning for agent teams and its implications for single agent planning
- Defensive alliances in graphs
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees
- Approximation of minimum weight spanners for sparse graphs
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Bounding tree-width via contraction on the projective plane and torus
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- The balanced satisfactory partition problem
- Improved self-reduction algorithms for graphs with bounded treewidth
- Multidimensional bipartite trees
- Excluding any graph as a minor allows a low tree-width 2-coloring
- Sublinear-space approximation algorithms for Max \(r\)-SAT
- Self-avoiding walks and multiple context-free languages
- Nested cycles in large triangulations and crossing-critical graphs
- Universal augmentation schemes for network navigability
- Some results on tree decomposition of graphs
- On strong tree-breadth
- \(K_{a,k}\) minors in graphs of bounded tree-width
- A characterization of some graph classes using excluded minors
- On the colored Tutte polynomial of a graph of bounded treewidth
- On the complexity of reasoning about opinion diffusion under majority dynamics
- Excluding Subdivisions of Infinite Cliques
- Burning two worlds
- scientific article; zbMATH DE number 7525509 (Why is no real title available?)
- 2-connecting outerplanar graphs without blowing up the pathwidth
- Compact representation of graphs with bounded bandwidth or treedepth
- The Menger-like property of the three-width of infinite graphs
- Some recent progress and applications in graph minor theory
- Tree-chromatic number
- Sublinear separators, fragility and subexponential expansion
- Interdiction problems on planar graphs
- Finite reflection groups and graph norms
- Grids and their minors
- Graph minors and parameterized algorithm design
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
- Treewidth of planar graphs: connections with duality
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- Partitions versus sets: a case of duality
- On tree-partitions of graphs
- Treewidth of the generalized Kneser graphs
- An Experimental Study of the Treewidth of Real-World Graph Data
- Efficiently enumerating minimal triangulations
- The \(k\)-strong induced arboricity of a graph
- Interval routing in reliability networks
- On the complexity of core, kernel, and bargaining set
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
- Algebras for tree decomposable graphs
- Provably shorter regular expressions from finite automata
- Bounds for mean colour numbers of graphs
- An analysis of the parameterized complexity of periodic timetabling
- Circumference and pathwidth of highly connected graphs
- Tree decomposition and discrete optimization problems: a survey
- The complexity of learning minor closed graph classes
- Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs
- Fugitive-search games on graphs and related parameters
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- Coloring temporal graphs
- Positive semidefinite zero forcing numbers of two classes of graphs
- A meta-theorem for distributed certification
- On preprocessing techniques and their impact on propositional model counting
- Faster algorithms for quantitative verification in bounded treewidth graphs
- scientific article; zbMATH DE number 4095479 (Why is no real title available?)
- Hypertree-depth and minors in hypergraphs
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
- New limits of treewidth-based tractability in optimization
- Combinatorial problems on \(H\)-graphs
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs
- Succinct certification of monotone circuits
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Maximum flow under proportional delay constraint
- On fractional fragility rates of graph classes
- Finding Hamiltonian cycle in graphs of bounded tree-width: experimental evaluation
- Beyond outerplanarity
- Even-power of cycles with many vertices are type 1 total colorable
- Cooperative games with overlapping coalitions: charting the tractability frontier
- Clifford algebras meet tree decompositions
- Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case
- Maximizing ink in partial edge drawings of \(k\)-plane graphs
- Helly-gap of a graph and vertex eccentricities
- A parameterized view on the complexity of dependence logic
- Bundled crossings revisited
- An improved planar graph product structure theorem
- On the harmless set problem parameterized by treewidth
- An improvement of Reed's treewidth approximation
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
- LP formulations for polynomial optimization problems
- On the parameterized complexity of the geodesic hull number
- An improvement of Reed's treewidth approximation
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
- Characteristic function games with restricted agent interactions: core-stability and coalition structures
- The tree-width of C
- Pushdown reachability with constant treewidth
- Upper and lower degree-constrained graph orientation with minimum penalty
- A new approach on locally checkable problems
- Clustered 3-colouring graphs of bounded degree
- On the satisfiability of quantum circuits of small treewidth
This page was built for publication: Graph minors. III. Planar tree-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799684)
