✦ LIBER ✦

Antiwebs are rank-perfect

✍ Scribed by Annegret K. Wagler

Book ID: 106308109
Publisher: Springer
Year: 2004
Tongue: English
Weight: 70 KB
Volume: 2
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-003-0032-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the Chvátal-rank of Ant

A lower bound on the Chvátal-rank of Antiwebs

✍ Eugenia Holm; Luis M. Torres; Annegret K. Wagler 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 177 KB

Almost all webs are not rank-perfect

✍ Arnaud Pêcher; Annegret K. Wagler 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 270 KB

Rank-perfect and" weakly rank-perfect gr

Rank-perfect and" weakly rank-perfect graphs

✍ Annegret K. Wagler 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 325 KB

Most powerful rank tests for perfect ran

Most powerful rank tests for perfect rankings

✍ Jesse Frey; Le Wang 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 261 KB

On Perfect Codes: Rank and Kernel

✍ Kevin T. Phelps; Mercè Villanueva 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 104 KB

Cycle-perfect graphs are perfect

✍ Le, Van Bang 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB 👁 2 views

The cycle graph of a graph G is the edge intersection graph of the set of all the induced cycles of G. G is called cycle-perfect if G and its cycle graph have no chordless cycles of odd length at least five. We prove the statement of the title. 0 1996 John Wiley &