On Decomposing Regular Graphs Into Isomorphic Double-Stars
A double-star is a tree with exactly two vertices of degree greater than 1. If T is a double-star where the two vertices of degree greater than one have degrees k1+1 and k2+1, then T is denoted by Sk1,k2 . In this note, we show that every double-star with n edges decomposes every 2n-regular graph. W...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1779 |