Degree and stability number condition for the existence of connected factors in graphs

DOI10.1007/S12190-008-0135-3zbMath1173.05038OpenAlexW1971886830MaRDI QIDQ1032554

Jian-Sheng Cai, Gui Zhen Liu

Publication date: 26 October 2009

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-008-0135-3

zbMATH Keywords

stability numberminimum degree\(f\)-factorconnected (\(f - 2,f\))-factorconnected \((f,f+1)\)-factor

Mathematics Subject Classification ID

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

Cites Work

• Some results on binding number and fractional perfect matching
• Binding number and Hamiltonian \((g,f)\)-factors in graphs
• On connencted \([g,f+1\)-factors in graphs]
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Independence number, connectivity, and r‐factors
• The Factors of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degree and stability number condition for the existence of connected factors in graphs