Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (Q856888)
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: Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs |
scientific article; zbMATH DE number 5080077
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs |
scientific article; zbMATH DE number 5080077 |
Statements
Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (English)
0 references
14 December 2006
0 references
treewidth
0 references
linear-time algorithm
0 references
co-chordal graphs
0 references
0.9225247
0 references
0.9040051
0 references
0.9025697
0 references
0 references
0 references
0 references
0.8788961
0 references
