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

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

Hans L. Bodlaender

Publication date: 6 January 2004

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

zbMATH Keywords

treewidth; graph algorithms; triangulated graphs; chordal graphs; pathwidth; interval graphs

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)