Tree-Width and Optimization in Bounded Degree Graphs
From MaRDI portal
Publication:3508553
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cites work
- A characterization of graphs without long induced paths
- Chordal bipartite graphs of bounded tree- and clique-width
- Domination in convex and chordal bipartite graphs
- Edge Dominating Sets in Graphs
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- Grad and classes with bounded expansion. I: Decompositions
- Independent domination in finitely defined classes of graphs
- Line graphs of bounded clique-width
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- New results on induced matchings
- NP-hard graph problems and boundary classes of graphs
- On linear and circular structure of (claw, net)-free graphs
- On maximal independent sets of vertices in claw-free graphs
- On maximum induced matchings in bipartite graphs
- On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
- On the complexity of domination number determination in monogenic classes of graphs
- On the diameter ofi-center in a graph without long induced paths
- Some results on graphs without long induced paths
- The tree- and clique-width of bipartite graphs in special classes
- Treewidth for graphs with small chordality
- Upper bounds to the clique width of graphs
Cited in
(18)- Resource allocation in bounded degree trees
- Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
- Graph searching and a min-max theorem for tree-width
- Tree-edges deletion problems with bounded diameter obstruction sets
- Trimming weighted graphs of bounded treewidth
- scientific article; zbMATH DE number 2044920 (Why is no real title available?)
- Tree-width and circumference of graphs
- Canonizing Graphs of Bounded Tree Width in Logspace
- Optimal parametric search on graphs of bounded tree-width
- Treewidth of display graphs: bounds, brambles and applications
- scientific article; zbMATH DE number 6783432 (Why is no real title available?)
- scientific article; zbMATH DE number 2188361 (Why is no real title available?)
- Induced subgraphs of bounded degree and bounded treewidth
- Graph-Theoretic Concepts in Computer Science
- Degree sequence optimization in bounded treewidth
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- Graph classes with and without powers of bounded clique-width
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
This page was built for publication: Tree-Width and Optimization in Bounded Degree Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3508553)
