On tree partitions (Q2744375)
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 1648967
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On tree partitions |
scientific article; zbMATH DE number 1648967 |
Statements
2 May 2002
0 references
tree
0 references
vertex partition
0 references
splitting number
0 references
0 references
0 references
0 references
0.9429727
0 references
0 references
0 references
0 references
On tree partitions (English)
0 references
Let \(G=(V,E)\) be a graph. Then the splitting number of \(G\) is the maximum size of \(R,R\subset V,\) so that there exists \(S\subset V\) with the property that the subgraphs induced by \(V-R\) and \(V-S\) are isomorphic. The author determines the splitting number for trees of maximum degree three having at most one vertex of degree two.
0 references
