Necessary edges in \(k\)-chordalisations of graphs

DOI10.1023/A:1027320705349zbMath1031.05120OpenAlexW2135382359MaRDI QIDQ1417852

Hans L. Bodlaender

Publication date: 6 January 2004

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1027320705349

zbMATH Keywords

treewidthgraph algorithmstriangulated graphschordal graphspathwidthinterval graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Courcelle's theorem -- a game-theoretic approach ⋮ Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth ⋮ Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization ⋮ A cubic kernel for feedback vertex set and loop cutset ⋮ Treewidth computations. II. Lower bounds

This page was built for publication: Necessary edges in \(k\)-chordalisations of graphs