Uniform Star-factors of Graphs with Girth Three

MaRDI QIDQ5442532zbMATH OpenFDO

Authors Qinglin Roger Yu, Y. Wu

Publication date 22 February 2008

Full work available at URL https://arxiv.org/abs/0707.0224

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: A {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 $mathscrU$ of graphs satisfying the property that every star-factor of a member graph has the same number of edges. They determined the family $mathscrU$ 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.

Recommendations

• On graphs having uniform size star factors
• scientific article; zbMATH DE number 7774082
• 3-star factors in random d-regular graphs
• Uniformly weighted star-factors of graphs.
• Existence of 3-factors in 2-connected star-free graphs
• Star-uniform graphs
• Unavoidable stars in 3-graphs
• Strong \(f\)-star factors of graphs
• Induced star-triangle factors of graphs
• Star-cycle factors of graphs

Cited in

(4)

• Star-uniform graphs
• Uniformly weighted star-factors of graphs.
• On graphs having uniform size star factors
• scientific article; zbMATH DE number 7774082 (Why is no real title available?)

This page was built for publication: Uniform Star-factors of Graphs with Girth Three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5442532)