Connected \([a,b]\)-factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
From MaRDI portal
Publication:1817586
DOI10.1016/S0012-365X(99)00113-2zbMath0936.05074MaRDI QIDQ1817586
Publication date: 3 January 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (3)
Approximation and Exact Algorithms for Special Cases of Connected f-Factors ⋮ Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b\)-factor] ⋮ Some problems on factorizations with constraints in bipartite graphs
This page was built for publication: Connected \([a,b]\)-factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
