Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs

DOI10.1007/S12190-008-0125-5zbMath1172.05343OpenAlexW2073245506MaRDI QIDQ1032542

Hongxia Liu, Gui Zhen Liu

Publication date: 26 October 2009

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-008-0125-5

zbMATH Keywords

graphminimum degree\((g,f)\)-factorbinding number\((g,f,n)\)-critical graph

Mathematics Subject Classification ID

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

Related Items (9)

Toughness and \((a,b,k)\)-critical graphs ⋮ A binding number condition for graphs to be \((a, b, k)\)-critical graphs ⋮ On toughness and fractional \((g,f,n)\)-critical graphs ⋮ A SUFFICIENT CONDITION FOR A GRAPH TO BE A FRACTIONAL (f, n)-CRITICAL GRAPH ⋮ NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS ⋮ Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs ⋮ Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs ⋮ Remarks on fractional ID-\(k\)-factor-critical graphs ⋮ STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS

Cites Work

• On toughness and \((g,f)\)-factors in bipartite graphs
• Minimum degree of a graph and the existence of k-factors
• On n-extendable graphs
• A new degree condition for graphs to have \([a,b\)-factor]
• Some results on binding number and fractional perfect matching
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Notes on the binding numbers for (a, b, k)-critical graphs
• On the structure of factorizable graphs
• The binding number of a graph and its Anderson number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs