NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS

DOI10.1017/S0004972708000270zbMath1140.05320OpenAlexW2008810497MaRDI QIDQ3514863

Si-zhong Zhou, Yang Xu

Publication date: 23 July 2008

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

Full work available at URL: https://doi.org/10.1017/s0004972708000270

zbMATH Keywords

graphminimum degree\((a,b,k)\)-critical graph\([a,b\)-factor]neighbourhood

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 (4)

Toughness and \((a,b,k)\)-critical graphs ⋮ NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS ⋮ A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs ⋮ Independence number, connectivity and \((a,b,k)\)-critical graphs

Cites Work

• Unnamed Item
• A new degree condition for graphs to have \([a,b\)-factor]
• On k-factor-critical graphs
• k -Factors and Neighbourhoods of Independent Sets in Graphs

This page was built for publication: NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS