Degree conditions of fractional ID-\(k\)-factor-critical graphs

zbMath1260.05119MaRDI QIDQ708448

Yan Zhu, Renying Chang, Gui Zhen Liu

Publication date: 14 October 2010

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: http://math.usm.my/bulletin/html/vol33_3_1.html

zbMATH Keywords

independent setfractional \(k\)-factorfractional ID-\(k\)-factor-critical

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs] ⋮ A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs] ⋮ Binding numbers for fractional ID-\(k\)-factor-critical graphs ⋮ Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs ⋮ Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs ⋮ Degree conditions for fractional \((g,f,n^\prime,m)\)-critical deleted graphs and fractional ID-\((g,n,f,m)\)-deleted graphs ⋮ Remarks on fractional ID-\(k\)-factor-critical graphs ⋮ Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs

This page was built for publication: Degree conditions of fractional ID-\(k\)-factor-critical graphs