Uniform Star-factors of Graphs with Girth Three

Simple item page
dc.creatorWu, Yunjian
dc.creatorYu, Qinglin
dc.date2007-07-02
dc.date.accessioned2026-07-07T08:13:32Z
dc.date.available2026-07-07T08:13:32Z
dc.descriptionA {\it star-factor} of a graph $G$ is a spanning subgraph of $G$ such that each component of which is a star. Recently, Hartnell and Rall studied a family $\mathscr{U}$ of graphs satisfying the property that every star-factor of a member graph has the same number of edges. They determined the family $\mathscr{U}$ 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.
dc.identifierhttps://arxiv.org/abs/0707.0224
dc.identifierhttp://arxiv.org/abs/0707.0224
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132799
dc.subjectCombinatorics
dc.subject05C69, 05C70
dc.titleUniform Star-factors of Graphs with Girth Three
dc.typetext

Files

Collections

arXiv