Uniform Star-factors of Graphs with Girth Three
Combinatorics
2007-07-03 v1
Abstract
A {\it star-factor} of a graph is a spanning subgraph of such that each component of which is a star. Recently, Hartnell and Rall studied a family of graphs satisfying the property that every star-factor of a member graph has the same number of edges. They determined the family when the girth is at least five. In this paper, we investigate the family of graphs with girth three and determine all members of this family.
Keywords
Cite
@article{arxiv.0707.0224,
title = {Uniform Star-factors of Graphs with Girth Three},
author = {Yunjian Wu and Qinglin Yu},
journal= {arXiv preprint arXiv:0707.0224},
year = {2007}
}