✦ LIBER ✦

On the numbers of independent k-sets in a claw free graph

✍ Scribed by Yahya Ould Hamidoune

Book ID: 107884294
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 184 KB
Volume: 50
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90079-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independent sets in {claw,K4}-free 4-reg

Independent sets in {claw,K4}-free 4-regular graphs

✍ Kang, Liying; Wang, Dingguo; Shan, Erfang 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Independent sets in { claw, K4 } -free 4

Independent sets in { claw, K4 } -free 4-regular graphs

✍ Kang, Liying (author);Wang, Dingguo (author);Shan, Erfang (author) 📂 Article 📅 2014 🏛 Elsevier 🌐 English ⚖ 572 KB

Local Optimality and Its Application on

Local Optimality and Its Application on Independent Sets for k-claw Free Graphs

✍ Gang Yu; Olivier Goldschmidt 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 165 KB

On the clique-transversal number in (cla

On the clique-transversal number in (claw,K4)-free 4-regular graphs

✍ Wang, Ding Guo; Shan, Er Fang; Liang, Zuo Song 📂 Article 📅 2013 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 228 KB

On the independence number in K1, r+1-fr

On the independence number in K1, r+1-free graphs

✍ Zdeněk Ryjáček; Ingo Schiermeyer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 353 KB

In this paper we use the degree sequence, order, size and vertex connectivity of a K 1,,+ 1 -free graph or of an almost claw-free graph to obtain several upper bounds on its independence number. We also discuss the sharpness of these results.

On the choice number of claw-free perfec

On the choice number of claw-free perfect graphs

✍ Sylvain Gravier; Frédéric Maffray 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 273 KB

We prove that every 3-chromatic claw-free perfect graph is 3-choosable.