Graph minors. III. Planar tree-width
From MaRDI portal
Publication:799684
DOI10.1016/0095-8956(84)90013-3zbMATH Open0548.05025DBLPjournals/jct/RobertsonS84OpenAlexW2002722727WikidataQ56141697 ScholiaQ56141697MaRDI QIDQ799684FDOQ799684
Authors: Neil Robertson, Paul Seymour 
Publication date: 1984
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(84)90013-3
Recommendations
Cites Work
Cited In (only showing first 100 items - show all)
- Positive semidefinite zero forcing numbers of two classes of graphs
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Clifford algebras meet tree decompositions
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth.
- Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation
- Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
- On preprocessing techniques and their impact on propositional model counting
- An Improvement of Reed’s Treewidth Approximation
- Combinatorial problems on \(H\)-graphs
- Clustered 3-colouring graphs of bounded degree
- Title not available (Why is that?)
- On fractional fragility rates of graph classes
- Bidimensionality and Kernels
- Decompositions of triangle-dense graphs
- Graph Minors I: A Short Proof of the Path-width Theorem
- A new approach on locally checkable problems
- Succinct monotone circuit certification: planarity and parameterized complexity
- On classes of graphs with strongly sublinear separators
- Energy complexity of satisfying assignments in monotone circuits: on the complexity of computing the best case
- A parameterized view on the complexity of dependence logic
- An improved planar graph product structure theorem
- On the harmless set problem parameterized by treewidth
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs
- Coloring temporal 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
- Beyond outerplanarity
- Hypertree-depth and minors in hypergraphs
- LP formulations for polynomial optimization problems
- Helly-gap of a graph and vertex eccentricities
- An improvement of Reed's treewidth approximation
- Pushdown reachability with constant treewidth
- The theory of guaranteed search on graphs
- The tree-width of C
- Faster algorithms for quantitative verification in bounded treewidth graphs
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover}
- On the scramble number of graphs
- Maximum flow under proportional delay constraint
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
- New limits of treewidth-based tractability in optimization
- Cooperative games with overlapping coalitions: charting the tractability frontier
- On the parameterized complexity of the geodesic hull number
- On the satisfiability of quantum circuits of small treewidth
- On the satisfiability of quantum circuits of small treewidth
- Characteristic function games with restricted agent interactions: core-stability and coalition structures
- An FPT 2-approximation for tree-cut decomposition
- A short note on the complexity of computing strong pathbreadth
- The P3 infection time is W[1]-hard parameterized by the treewidth
- Upper and lower degree-constrained graph orientation with minimum penalty
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs
- A meta-theorem for distributed certification
- Even-power of cycles with many vertices are type 1 total colorable
- Tree projections and structural decomposition methods: minimality and game-theoretic characterization
- An efficient partitioning oracle for bounded-treewidth graphs
- An existential locality theorem
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Kernelization: new upper and lower bound techniques
- The structure of the models of decidable monadic theories of graphs
- Layered separators in minor-closed graph classes with applications
- The dag-width of directed graphs
- On self-duality of branchwidth in graphs of bounded genus
- The complexity of two graph orientation problems
- On the hyperbolicity constant in graph minors
- Tree-width of hypergraphs and surface duality
- Title not available (Why is that?)
- Fixed-parameter algorithms for the cocoloring problem
- A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound
- On some graph densities in locally dense graphs
- Constant-degree graph expansions that preserve treewidth
- A note on planar graphs with large width parameters and small grid-minors
- Linear connectivity forces large complete bipartite minors
- Graph minors. VII: Disjoint paths on a surface
- A partial k-arboretum of graphs with bounded treewidth
- A little statistical mechanics for the graph theorist
- Treewidth for graphs with small chordality
- Graph minors. V. Excluding a planar graph
- Datalog vs first-order logic
- Chordal embeddings of planar graphs
- On algorithms employing treewidth for \(L\)-bounded cut problems
- Posets with cover graph of pathwidth two have bounded dimension
- Approximate tree decompositions of planar graphs in linear time
- On the complexity of connection games
- Approximate tree decompositions of planar graphs in linear time
- Two approaches to Sidorenko's conjecture
- Graphs with magnetic Schrödinger operators of low corank
- Distance labeling scheme and split decomposition
- Directed tree-width
- Tree-width and large grid minors in planar graphs
- Entanglement and the complexity of directed graphs
- Complexity of secure sets
- Surfaces, tree-width, clique-minors, and partitions
- Rank-width and tree-width of \(H\)-minor-free graphs
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- Graph minors. I. Excluding a forest
- On the complexity of embedding planar graphs to minimize certain distance measures
- Minor-minimal planar graphs of even branch-width
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)
