A new degree condition for graphs to have \([a,b]\)-factor

DOI10.1016/j.disc.2004.09.010zbMath1059.05085OpenAlexW2027460894MaRDI QIDQ1764908

Jianxiang Li

Publication date: 22 February 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.09.010

zbMATH Keywords

factor\([a,b\)-factor]\((a,b,n)\)-critical graph

Mathematics Subject Classification ID

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

Related Items (8)

A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ Toughness and \((a,b,k)\)-critical graphs ⋮ NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS ⋮ A binding number condition for graphs to be \((a, b, k)\)-critical graphs ⋮ A sufficient condition for a graph to be an (a, b, k)-critical graph ⋮ Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs ⋮ Independence number, connectivity and \((a,b,k)\)-critical graphs ⋮ STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On n-extendable graphs
• A neighbourhood condition for graphs to have \([a,b\)-factors]
• On k-factor-critical graphs
• A degree condition for the existence of regular factors inK1,n-free graphs
• Subgraphs with prescribed valencies
• On the structure of factorizable graphs

This page was built for publication: A new degree condition for graphs to have \([a,b]\)-factor