\(K_{1,3}\)-factors in graphs

DOI10.1016/j.disc.2007.11.013zbMath1204.05075OpenAlexW2055226951MaRDI QIDQ998329

Yoshimi Egawa, Katsuhiro Ota, Shinya Fujita

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.013

zbMATH Keywords

minimum degreeclawfactorvertex-disjoint subgraphs

Mathematics Subject Classification ID

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

Related Items (2)

Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs ⋮ The existence of \(P_{\geq3}\)-factor covered graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On circuits in graphs
• Vertex-disjoint claws in graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4242796 An El-Zah�r type condition ensuring path-factors]
• K₄⁻‐factor in a graph
• On the maximal number of independent circuits in a graph
• Proof of the Alon-Yuster conjecture

This page was built for publication: \(K_{1,3}\)-factors in graphs