Treewidth of Chordal Bipartite Graphs
From MaRDI portal
Publication:4845852
DOI10.1006/JAGM.1995.1037zbMATH Open0839.68070OpenAlexW2088441646MaRDI QIDQ4845852FDOQ4845852
Authors: Ton Kloks, Dieter Kratsch 
Publication date: 28 May 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/16671
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Cited In (19)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- On 3-degree 4-chordal graphs
- Connected graph searching in chordal graphs
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- On the Treewidth and Pathwidth of Biconvex Bipartite Graphs
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- Treewidth for graphs with small chordality
- Chordal embeddings of planar graphs
- On list \(k\)-coloring convex bipartite graphs
- On factorial properties of chordal bipartite graphs
- Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
- The treewidth of 2-section of hypergraphs
- Listing all potential maximal cliques of a graph
- Chordal bipartite graphs of bounded tree- and clique-width
- Transversals of longest cycles in chordal and bounded tree-width graphs
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Partially ordered knapsack and applications to scheduling
- A revisit of the scheme for computing treewidth and minimum fill-in
- Approximation hardness of domination problems on generalized convex graphs
This page was built for publication: Treewidth of Chordal Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845852)
