✦ LIBER ✦

Coloring vertices of a graph or finding a Meyniel obstruction

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Entropy and a certain cost-minimal color

✍ Yasuichi Horibe; Ryoji Mitani 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Coloring the vertices of a graph with ma

✍ V. G. Vizing 📂 Article 📅 2010 🏛 Pleiades Publishing 🌐 English ⚖ 438 KB

Coloring the Vertices of a Graph With Me

✍ P.D. Johnson Jr.; C.A. Rodger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 360 KB

A linear time algorithm for finding all

✍ Ting-Yem Ho; Yue-Li Wang; Ming-Tsan Juan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 488 KB

Graphs without odd holes, parachutes or

✍ Michele Conforti; Gérard Cornuéjols 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 315 KB

New methods to color the vertices of a g

✍ Brélaz, Daniel 📂 Article 📅 1979 🏛 Association for Computing Machinery 🌐 English ⚖ 462 KB