Factorizations of complete graphs into caterpillars of diameter 5 (Q960966)
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 5687589
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Factorizations of complete graphs into caterpillars of diameter 5 |
scientific article; zbMATH DE number 5687589 |
Statements
Factorizations of complete graphs into caterpillars of diameter 5 (English)
0 references
29 March 2010
0 references
The authors characterize caterpillars of diameter 5 that factorize a complete graph \(K_{2n}\). A new recursive method for factorization of complete graphs into spanning trees is given. They check all starting cases for the recursive method case by case.
0 references
graph factorization
0 references
spanning trees
0 references
graph labeling
0 references
caterpillars
0 references
0 references
0 references
0.9460847973823548
0 references
0.939369797706604
0 references
0.9271395206451416
0 references
