STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS
From MaRDI portal
Publication:2874038
DOI10.1142/S1793830913500274zbMath1280.05108MaRDI QIDQ2874038
Yang Xu, Si-zhong Zhou, Jian-Cheng Wu
Publication date: 28 January 2014
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Cites Work
- A binding number condition for graphs to be \((a, b, k)\)-critical graphs
- Star subdivisions and connected even factors in the square of a graph
- 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]
- The existence of \(k\)-factors in squares of graphs
- The stability number and connected \([k,k+1\)-factor in 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
This page was built for publication: STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS
