BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS
From MaRDI portal
Publication:3115766
DOI10.1017/S0004972711002784zbMath1231.05219OpenAlexW2163121739MaRDI QIDQ3115766
Lan Xu, Qiuxiang Bian, Si-zhong Zhou
Publication date: 10 February 2012
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972711002784
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b-FACTOR-CRITICAL GRAPHS]
Cites Work
- Unnamed Item
- A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
- The existence of \(k\)-factors in squares of graphs
- The stability number and connected \([k,k+1\)-factor in graphs]
- Independence number, connectivity and \((a,b,k)\)-critical graphs
- Toughness and \((a,b,k)\)-critical graphs
- Toughness and the existence of fractional \(k\)-factors of graphs
- Fan-type results for the existence of [\(a\),\(b\)-factors]
- A NEIGHBOURHOOD CONDITION FOR GRAPHS TO BE FRACTIONAL (k, m)-DELETED GRAPHS
- Some new sufficient conditions for graphs to have fractionalk-factors
This page was built for publication: BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS