Forbidden minors characterization of partial 3-trees (Q913807)
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 4148110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Forbidden minors characterization of partial 3-trees |
scientific article; zbMATH DE number 4148110 |
Statements
Forbidden minors characterization of partial 3-trees (English)
0 references
1990
0 references
A partial k-tree is a subgraph of a graph that can be reduced to the complete graph of order k by a sequence of operations each being a removal of a degree k vertex with completely connected neighbours. In the paper the class of partial 3-trees is characterized by its set of four minimal forbidden minors.
0 references
graph minors
0 references
trees
0 references
0 references
0.8969913125038147
0 references
0.8449254631996155
0 references
0.7936080694198608
0 references
