When all minimal vertex separators induce complete or edgeless subgraphs (Q2864857)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6233206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | When all minimal vertex separators induce complete or edgeless subgraphs |
scientific article; zbMATH DE number 6233206 |
Statements
26 November 2013
0 references
chordal graph
0 references
independent separator graph
0 references
unichord-free graph
0 references
extreme separator graph
0 references
When all minimal vertex separators induce complete or edgeless subgraphs (English)
0 references
0.8419537544250488
0 references
0.8339089751243591
0 references
0.8308149576187134
0 references
0.8069208264350891
0 references
0.7895537614822388
0 references
