Binding numbers of graphs and the existence of [a,b]-factors

MaRDI QIDQ3403829zbMATH OpenFDO

Authors Sizhong Zhou

Publication date 12 February 2010

zbMATH Keywords

\([ab\)-factor]binding numbergraphsubgraph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 844163
• A neighborhood condition for graphs to have \([a, b]\)-factors. II
• Binding numbers and \([a,b]\)-factors excluding a given \(k\)-factor
• Sufficient condition for the existence of \(\left[ {a,b} \right]\)-factors in graphs
• A Neighborhood Condition for Graphs to Have [a, b]-Factors III

Cited in

(4)

• Sufficient condition for the existence of \(\left[ {a,b} \right]\)-factors in graphs
• scientific article; zbMATH DE number 844163 (Why is no real title available?)
• scientific article; zbMATH DE number 5041506 (Why is no real title available?)
• Binding numbers and \([a,b]\)-factors excluding a given \(k\)-factor

This page was built for publication: Binding numbers of graphs and the existence of \([a,b]\)-factors

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