Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
From MaRDI portal
Publication:741726
DOI10.1016/j.dam.2013.09.005zbMath1300.05208arXiv1111.3879MaRDI QIDQ741726
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.3879
independence number; minimum degree; pseudo \([2,b\)-factor]
05C35: Extremal problems in graph theory
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C07: Vertex degrees
Related Items
Path-factor critical covered graphs and path-factor uniform graphs, Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors], A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
Cites Work