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

zbMATH Open1174.05461MaRDI QIDQ3610243FDOQ3610243

Authors: Bentang Su, Leliang He, Xianyong Meng 

Publication date: 6 March 2009

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

zbMATH Keywords

minimum degreeindependence number\([a,b\)-factor]

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)

Cited In (6)

• Title not available (Why is that?)
• A Fan-type condition for the existence of \([a,b]\)-factors
• Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
• Minimum degree, independence number and regular factors
• Two results on the existence of \([a,b]\)-factors in graphs
• Independence number and \([a,b]\)-factors of 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)