Connected [a,b]-factors in K₁,n-free graphs containing an [a,b]-factor

DOI10.1016/S0012-365X(99)00113-2MaRDI QIDQ1817586zbMATH OpenFDO

Authors Taro Tokuda

Publication date 3 January 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

connected factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
• scientific article; zbMATH DE number 1894980
• A degree condition for the existence of \([a,b]\)-factors in \(K_{1,n}\)-free graphs
• Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor

Cited in

(7)

• scientific article; zbMATH DE number 6475977 (Why is no real title available?)
• Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
• Regular factors in 2-connected \(K_{1,n}\)-free graphs
• Approximation and exact algorithms for special cases of connected \(f\)-factors
• On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
• Connected \([a,b]\)-factors in graphs
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817586)