Some results on fractional \(n\)-factor-critical graphs

DOI10.1007/BF02832353zbMath1133.05080OpenAlexW2061592374MaRDI QIDQ2471336

Na Wang, Jiguo Yu, Qiuju Bian, Gui Zhen Liu

Publication date: 22 February 2008

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

Full work available at URL: https://doi.org/10.1007/bf02832353

zbMATH Keywords

maximum matchingfractional perfect matchingcomplete closure

Mathematics Subject Classification ID

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

Related Items (1)

On toughness and fractional \((g,f,n)\)-critical graphs

Cites Work

• On 1-factors and matching extension
• Factor criticality and complete closure of graphs
• Closure and factor-critical graphs
• On k-factor-critical graphs
• Fractional \((g,f)\)-factors of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some results on fractional \(n\)-factor-critical graphs