✦ LIBER ✦

Minimum degree, independence number and pseudo [2,b]-factors in graphs

✍ Scribed by Bekkai, Siham

Book ID: 122129327
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 410 KB
Volume: 162
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.09.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum degree, independence number and

Minimum degree, independence number and regular factors

✍ Thomas Niessen 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 643 KB

Independence number and minimum degree f

Independence number and minimum degree for fractional ID-k-factor-critical graphs

✍ Zhou, Sizhong; Xu, Lan; Sun, Zhiren 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 160 KB

Minimum independent generalized t-degree

Minimum independent generalized t-degree and independence number in K1,r+1-free graphs

✍ O. Favaron; Y. Redouane 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 448 KB

The minimum independent generalized t-degree of a graph G = (V,E) is ut = min{ IN(H H is an independent set of t vertices of G}, with N(H) = UxtH N(x). In a KI,~+I -free graph, we give an upper bound on u! in terms of r and the independence number CI of G. This generalizes already known results on u

Binding Number, Minimum Degree, and Cycl

Binding Number, Minimum Degree, and Cycle Structure in Graphs

✍ D. Bauer; E. Schmeichel 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

Domination number in graphs with minimum

Domination number in graphs with minimum degree two

✍ Er Fang Shan; Moo Young Sohn; Xu Dong Yuan; Michael A. Henning 📂 Article 📅 2009 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 264 KB

Independence and matching number in grap

Independence and matching number in graphs with maximum degree 4

✍ Joos, Felix 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 376 KB