Treewidth for graphs with small chordality
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3961650 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 3404264 (Why is no real title available?)
- k-Degenerate Graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A Separator Theorem for Planar Graphs
- A Sufficient Condition for Backtrack-Free Search
- An approximation algorithm for clustering graphs with dominating diametral path
- Applications of a Planar Separator Theorem
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Asteroidal Triple-Free Graphs
- Complexity of Finding Embeddings in a k-Tree
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Finding and counting given length cycles
- Fugitive-search games on graphs and related parameters
- Generalized Nested Dissection
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. III. Planar tree-width
- Min Cut is NP-complete for edge weighted trees
- On the pathwidth of chordal graphs
- Parallel algorithms with optimal speedup for bounded treewidth
- TREEWIDTH OF CIRCLE GRAPHS
- The Linkage of a Graph
- The Pathwidth and Treewidth of Cographs
- Transitiv orientierbare Graphen
- Treewidth and Pathwidth of Permutation Graphs
- Treewidth of Chordal Bipartite Graphs
- Treewidth of Circular-Arc Graphs
- Weakly triangulated graphs
Cited in
(39)- Treewidth of graphs with balanced separations
- Induced 2-regular subgraphs in k-chordal cubic graphs
- Tree-width dichotomy
- Coloring vertices of claw-free graphs in three colors
- A Dirac-type characterization of \(k\)-chordal graphs
- Connected graph searching in chordal graphs
- Graphs without large apples and the maximum weight independent set problem
- On 3-degree 4-chordal graphs
- On the chordality of a graph
- Boundary Classes of Planar Graphs
- Recent developments on graphs of bounded clique-width
- Characterizing Graphs of Small Carving-Width
- Graphs with at most two moplexes
- Treewidth distance on phylogenetic trees
- Tree-decompositions of small pathwidth
- Partitioning the vertices of a cubic graph into two total dominating sets
- In absence of long chordless cycles, large tree-width becomes a local phenomenon
- Treewidth of Chordal Bipartite Graphs
- Dominating induced matchings in graphs without a skew star
- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
- On the tree-width of even-hole-free graphs
- Edge-treewidth: algorithmic and combinatorial properties
- On the pathwidth of chordal graphs
- Fugitive-search games on graphs and related parameters
- Tree-width and circumference of graphs
- Results on hyperbolicity in graphs: a survey
- scientific article; zbMATH DE number 7310078 (Why is no real title available?)
- Chordal bipartite graphs of bounded tree- and clique-width
- Metric Dimension of Bounded Tree-length Graphs
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- A spectral lower bound for the treewidth of a graph and its consequences
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Metric dimension of bounded width graphs
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- On balanced separators, treewidth, and cycle rank
- Boxicity and treewidth
- Some results on connected vertex separators
- Tree-Width and Optimization in Bounded Degree Graphs
- Tree-decompositions with bags of small diameter
This page was built for publication: Treewidth for graphs with small chordality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372729)
