Independence number and minimum degree for [a,b]-factors

MaRDI QIDQ3610243zbMATH OpenFDO

Authors Bentang Su, Leliang He, Xianyong Meng

Publication date 6 March 2009

zbMATH Keywords

\([a,b\)-factor]independence numberminimum degree

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Independence number and \([a,b]\)-factors of graphs.
• Two results on the existence of \([a,b]\)-factors in graphs
• A neighbourhood condition for graphs to have \([a,b]\)-factors
• scientific article; zbMATH DE number 1790881
• Stability number and [a,b]‐factors in graphs

Cited in

(6)

• Minimum degree, independence number and regular factors
• Independence number and \([a,b]\)-factors of graphs.
• A Fan-type condition for the existence of \([a,b]\)-factors
• scientific article; zbMATH DE number 5953644 (Why is no real title available?)
• Two results on the existence of \([a,b]\)-factors in graphs
• Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs

This page was built for publication: Independence number and minimum degree for \([a,b]\)-factors

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