✦ LIBER ✦

A new subgraph expansion for obtaining coloring polynomials for graphs

✍ Scribed by J.F. Nagle

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Algorithm for On-line Coloring Bip

✍ Broersma, Hajo J.; Capponi, Agostino; Paulusma, Daniël 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 271 KB

A new proposal for graph-based image cla

✍ Morales-González, Annette; Acosta-Mendoza, Niusvel; Gago-Alonso, Andrés; García- 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 984 KB

A new polynomial-time algorithm for the

✍ A. Hertz 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 363 KB

A polynomial time algorithm for obtainin

✍ Shin-ichi Nakayama; Shigeru Masuyama 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 161 KB

A polynomial algorithm for finding (g, f

✍ Guizhen Liu; Xiaotie Deng 📂 Article 📅 2005 🏛 SP Science China Press 🌐 English ⚖ 181 KB

An algorithm for obtaining the chromatic

✍ S.I. Roschke; A.L. Furtado 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 579 KB