TOUGHNESS AND DEGREE CONDITION FOR FRACTIONAL ID-k-FACTOR-CRITICAL GRAPHS

DOI10.1142/S1793830914500268zbMath1296.05167MaRDI QIDQ2875691

Yuan Yuan, Zhi-ren Sun

Publication date: 11 August 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

minimum degreetoughnessfractional \(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) Vertex degrees (05C07)

Cites Work

• Unnamed Item

Related Items (2)

Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs ⋮ TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS

This page was built for publication: TOUGHNESS AND DEGREE CONDITION FOR FRACTIONAL ID-k-FACTOR-CRITICAL GRAPHS