Existence of 3-factors in 2-connected star-free graphs

MaRDI QIDQ2858080zbMATH OpenFDO

Authors Yoshimi Egawa, Keiko Kotani, Takamasa Yashima

Publication date 19 November 2013

Published in Far East Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.pphmj.com/abstract/7834.htm

zbMATH Keywords

connectivitystar-free3-factor

Mathematics Subject Classification ID

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

Recommendations

• Existence of 3-factors in \(K_{1,n}\)-free graphs with connectivity and edge-connectivity conditions
• 6-factors in 2-connected star-free graphs
• Forbidden subgraphs and the existence of a 2-factor
• On 2-factors in star-free graphs
• Regular factors in K_1,3‐free graphs

Cited in

(5)

• Uniform Star-factors of Graphs with Girth Three
• On 2-factors in star-free graphs
• Existence of 3-factors in \(K_{1,n}\)-free graphs with connectivity and edge-connectivity conditions
• 6-factors in 2-connected star-free graphs
• Existence of 4-factors in star-free graphs with edge-connectivity conditions

This page was built for publication: Existence of 3-factors in 2-connected star-free graphs

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