✦ LIBER ✦

Coloring Bull-Free Perfectly Contractile Graphs

✍ Scribed by Lévêque, Benjamin; Maffray, Frédéric

Book ID: 118196945
Publisher: Society for Industrial and Applied Mathematics
Year: 2008
Tongue: English
Weight: 264 KB
Volume: 21
Category: Article
ISSN: 0895-4801
DOI: 10.1137/06065948x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfectly contractile diamond-free graph

Perfectly contractile diamond-free graphs

✍ Rusu, Irena 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 415 KB

a graph with no odd hole and no stretcher is perfectly contractile, i.e., it can be reduced to a clique by successively contracting even pairs. We show that this conjecture is true for diamond-free graphs, and propose a polynomial algorithm to perform the successive contractions.

Coloring Bull-Free Perfect Graphs

✍ Penev, Irena 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 359 KB

Perfectly contractile graphs

✍ Marc E Bertschi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 416 KB

Bull-Free Weakly Chordal Perfectly Order

Bull-Free Weakly Chordal Perfectly Orderable Graphs

✍ Ryan B. Hayward 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 280 KB

Algorithms for Perfectly Contractile Gra

Algorithms for Perfectly Contractile Graphs

✍ Maffray, Frédéric; Trotignon, Nicolas 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 408 KB

Coloring perfect (K4 − e)-free graphs

✍ Alan Tucker 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 349 KB