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

DOI10.1016/J.DISC.2006.03.072zbMATH Open1106.05079OpenAlexW2552312508MaRDI QIDQ2433740FDOQ2433740

Authors: Taro Tokuda 

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

Recommendations

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

zbMATH Keywords

graph factor

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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

Cited In (5)

• Title not available (Why is that?)
• A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
• Title not available (Why is that?)
• On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
• Connected \([a,b]\)-factors in graphs

This page was built for publication: Connected 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 Q2433740)