✦ LIBER ✦

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

✍ Scribed by Zhou, Sizhong; Xu, Lan; Sun, Zhiren

Book ID: 119953569
Publisher: Springer
Year: 2012
Tongue: English
Weight: 160 KB
Volume: 84
Category: Article
ISSN: 0001-9054
DOI: 10.1007/s00010-012-0121-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Binding numbers for fractional ID-k-fact

Binding numbers for fractional ID-k-factor-critical graphs

✍ Zhou, Si Zhong 📂 Article 📅 2013 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 165 KB

Minimum degree, independence number and

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

✍ Bekkai, Siham 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 410 KB

Binding number and minimum degree for k-

Binding number and minimum degree for k-factors

✍ Norihide Tokushige 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 282 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 and minimum degree for th

Binding number and minimum degree for the existence of (g,f,n)-critical graphs

✍ Hongxia Liu; Guizhen Liu 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 292 KB

Proof of the Caccetta–Häggkvist conjectu

Proof of the Caccetta–Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two

✍ Lichiardopol, Nicolas 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 336 KB