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 this page instead for the normal view: When all minimal vertex separators induce complete or edgeless subgraphs |
scientific article; zbMATH DE number 6233206
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
