Characterizing k-chordal unichord-free graphs (Q4577849)
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: Characterizing k-chordal unichord-free graphs |
scientific article; zbMATH DE number 6913756
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing k-chordal unichord-free graphs |
scientific article; zbMATH DE number 6913756 |
Statements
Characterizing k-chordal unichord-free graphs (English)
0 references
3 August 2018
0 references
\(k\)-chordal graph
0 references
unichord-free graph
0 references
minimal separator
0 references
0 references
0.9546119
0 references
0.90430355
0 references
0 references
0.8970382
0 references
0 references
0 references
0.8931942
0 references
0.8926649
0 references
0.88949984
0 references
0.88929117
0 references
