A binding number condition for graphs to be \((a, b, k)\)-critical graphs

DOI10.1016/j.ajmsc.2012.01.001zbMath1251.05146OpenAlexW1982202523MaRDI QIDQ442161

Lan Xu, Jiashang Jiang, Si-zhong Zhou

Publication date: 10 August 2012

Published in: Arab Journal of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ajmsc.2012.01.001

zbMATH Keywords

graph\((a,b,k)\)-critical graph\([a,b\)-factor]binding number

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

STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS

Cites Work

• The existence of \(k\)-factors in squares of graphs
• Binding numbers of fractional \(k\)-deleted graphs
• Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• A new degree condition for graphs to have \([a,b\)-factor]
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• Notes on the binding numbers for (a, b, k)-critical graphs
• The binding number of a graph and its Anderson number
• Unnamed Item
• Unnamed Item
• Unnamed Item