Treewidth of Chordal Bipartite Graphs

DOI10.1006/jagm.1995.1037zbMath0839.68070OpenAlexW2088441646MaRDI QIDQ4845852

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

zbMATH Keywords

treewidthchordal bipartite graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items

Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs, Treewidth for graphs with small chordality, Partially ordered knapsack and applications to scheduling, On 3-degree 4-chordal graphs, On factorial properties of chordal bipartite graphs, Chordal embeddings of planar graphs, A revisit of the scheme for computing treewidth and minimum fill-in, A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs, \(k\)-chordal graphs: from cops and robber to compact routing via treewidth, Connected graph searching in chordal graphs, Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity, On list \(k\)-coloring convex bipartite graphs, Chordal bipartite graphs of bounded tree- and clique-width, Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds, Listing all potential maximal cliques of a graph