A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS

DOI10.1017/S0004972711003467zbMath1252.05182MaRDI QIDQ3167456

Hongxia Liu, Si-zhong Zhou, Zhi-ren Sun

Publication date: 2 November 2012

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

zbMATH Keywords

independent setminimum degreefractional \([a,b\)-factor]fractional ID-\([a,b\)-factor-critical graph]

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)

Related Items

A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs] ⋮ A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ Degree conditions for fractional \((g,f,n^\prime,m)\)-critical deleted graphs and fractional ID-\((g,n,f,m)\)-deleted graphs ⋮ Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs ⋮ Neighbourhood conditions for fractional ID-[a, b-factor-critical graphs]

Cites Work

• Unnamed Item
• Unnamed Item
• A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
• Binding numbers and connected factors
• Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor]
• Characterizations of maximum fractional \((g,f)\)-factors of graphs
• A minimum degree condition of fractional \((k,m)\)-deleted graphs
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Independent-set-deletable factor-critical power graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• The dynamics of a prey-dependent consumption model concerning integrated pest management
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS

This page was built for publication: A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS