On Double-Star Decomposition of Graphs

A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence (k1 + 1, k2 + 1, 1, . . . , 1) is denoted by Sk1,k2. We study the edge-decomposition of graphs into double-stars. It was proved that every double-star of size k decomposes every 2k-regular...

Full description

Bibliographic Details
Main Authors: Akbari Saieed, Haghi Shahab, Maimani Hamidreza, Seify Abbas
Format: Article
Language:English
Published: University of Zielona Góra 2017-08-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1933

Similar Items