Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
From MaRDI portal
Publication:2433740
DOI10.1016/j.disc.2006.03.072zbMath1106.05079OpenAlexW2552312508MaRDI QIDQ2433740
Publication date: 30 October 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.072
Related Items (1)
A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs]
Cites Work
- Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor
- Connected \([a,b\)-factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor]
- Unnamed Item
This page was built for publication: Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor