TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS

DOI10.4134/JKMS.2014.51.1.055zbMath1285.05147MaRDI QIDQ2870474

Wei Gao, Tianwei Xu, Juxiang Zhou, Li Liang

Publication date: 21 January 2014

Published in: Journal of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL: http://www.mathnet.or.kr/mathnet/kms_content.php?no=411353

zbMATH Keywords

toughnessfractional \((g,f)\)-factorfractional \((g,f,n)\)-critical

Mathematics Subject Classification ID

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

Related Items (8)

A sufficient condition for the existence of a k-factor excluding a given r-factor ⋮ Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties ⋮ A neighborhood union condition for fractional $(k,n',m)$-critical deleted graphs ⋮ Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs ⋮ An independent set degree condition for fractional critical deleted graphs ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted ⋮ On \(P_{\geq 3}\)-factor deleted graphs

This page was built for publication: TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS