Stability number and [a,b]‐factors in graphs
From MaRDI portal
Publication:4810500
DOI10.1002/jgt.20008zbMath1046.05058OpenAlexW4231584935MaRDI QIDQ4810500
Publication date: 16 August 2004
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20008
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items
A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs] ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ Spectral radius and \([a,b\)-factors in graphs] ⋮ Sufficient conditions for a graph to have all \([a, b\)-factors and \((a, b)\)-parity factors] ⋮ Sufficient condition for the existence of an even \([a,b\)-factor in graph] ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ Stability number and \(f\)-factors in graphs ⋮ Minimum degree, independence number and pseudo \([2, b\)-factors in graphs] ⋮ Independence number, connectivity and \((a,b,k)\)-critical graphs ⋮ Proof of a conjecture on the spectral radius condition for \([a,b\)-factors]
Cites Work
This page was built for publication: Stability number and [a,b]‐factors in graphs