Necessary edges in \(k\)-chordalisations of graphs (Q1417852)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Necessary edges in k-chordalisations of graphs |
scientific article; zbMATH DE number 2021966
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Necessary edges in \(k\)-chordalisations of graphs |
scientific article; zbMATH DE number 2021966 |
Statements
Necessary edges in \(k\)-chordalisations of graphs (English)
0 references
6 January 2004
0 references
graph algorithms
0 references
chordal graphs
0 references
triangulated graphs
0 references
treewidth
0 references
interval graphs
0 references
pathwidth
0 references
0 references
0 references
0.88861096
0 references
0 references
0.8858311
0 references
0.8845066
0 references
0.8845066
0 references
0.8815777
0 references
0 references
