✦ LIBER ✦

On the perfect one—factorization conjecture

✍ Scribed by David G. Wagner

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 326 KB
Volume: 104
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90337-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the perfect graph conjecture

✍ H. Meyniel 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 160 KB

On perfect one-factorization of the comp

On perfect one-factorization of the complete graphK2p

✍ Midori Kobayashi 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 132 KB

A perfect one-factorization ofK36

✍ Midori Kobayashi; Hitoshi Awoki; Yoshimi Nakazaki; Gisaku Nakamura 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 80 KB

On the strong perfect graph conjecture

✍ Stephan Olariu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB

A graph G is perfect if for every induced subgraph H of G the chromatic number x(H) equals the largest number w ( H ) of pairwise adjacent vertices in H. Berge's famous Strong Perfect Graph Conjecture asserts that a graph G is perfect if and only if neither G nor its complement C contains an odd cho

On the strong perfect graph conjecture

✍ V Chvátal 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 144 KB

A perfect one-factorization of K52

✍ Adam J. Wolfe 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

## Abstract A starter derived even starter that induces a perfect one‐factorization of __K__~52~ is presented. This is the smallest order for which a perfect one‐factorization was not previously known and is the first new “small” order for which a perfect one‐factorization has been found in nearly