✦ LIBER ✦

t -Perfection Is Always Strong for Claw-Free Graphs

✍ Scribed by Bruhn, Henning; Stein, Maya

Book ID: 118197098
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 208 KB
Volume: 24
Category: Article
ISSN: 0895-4801
DOI: 10.1137/090769508

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strong T-Perfection of Bad- K 4 -Free Gr

Strong T-Perfection of Bad- K 4 -Free Graphs

✍ Schrijver, Alexander 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 182 KB

The Strong Perfect Graph Conjecture for

The Strong Perfect Graph Conjecture for pan-free graphs

✍ Stephan Olariu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 345 KB

A Combinatorial Algorithm for Minimum We

A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs

✍ Xueliang Li; Wenan Zang 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 215 KB

The Path Partition Conjecture is true fo

The Path Partition Conjecture is true for claw-free graphs

✍ J.E. Dunbar; M. Frick 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 148 KB

The validity of the strong perfect-graph

The validity of the strong perfect-graph conjecture for (K4−e)-free graphs

✍ K.R Parthasarathy; G Ravindra 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 205 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