✦ LIBER ✦

Clique Covers in Claw-Free Berge Graphs

✍ Scribed by Gianpaolo Oriolo

Book ID: 108498104
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 179 KB
Volume: 8
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80083-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique minors in claw-free graphs

✍ Alexandra Fradkin 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Clique or hole in claw-free graphs

✍ Henning Bruhn; Akira Saito 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Clique-transversal sets in 4-regular cla

Clique-transversal sets in 4-regular claw-free graphs

✍ Er Fang Shan; Li Ying Kang 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 212 KB

Closure, clique covering and degree cond

Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs

✍ Roman Kužel; Zdeněk Ryjáček; Jakub Teska; Petr Vrána 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 729 KB

Well-Covered Claw-Free Graphs

✍ David Tankus; Michael Tarsi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 336 KB

A polynomial algorithm for the minimum w

A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs

✍ Wen-Lian HSU; George L. Nemhauser 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 688 KB

Discrete Mathematics 3X ( 19X2) 6S-71 North-Holland Publishing Company 65 Let G = (V, E) be a graph with a positive number wt(v) assigned to each L' E V. A weighted clique saver of the vertices of G is a collection of cliques with a non-negative weight yC. assigned to each clique C in the collection