Title of article
Treewidth for graphs with small chordality Original Research Article
Author/Authors
Hans L. Bodlaender، نويسنده , , Dimitrios M. Thilikos، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
17
From page
45
To page
61
Abstract
A graph G is K-chordal, if it does not contain chordless cycles of length larger than k. The chordality lc of a graph G is the minimum k for which G is k-chordal. The degeneracy or the width of a graph is the maximum min-degree of any of its subgraphs. Our results are the following:
Keywords
Algorithms , NP-complete problems , Separators in Graphs , Treewidth , Width
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884639
Link To Document