✦ LIBER ✦

Unique Fulkerson coloring of Petersen minor-free cubic graphs

✍ Scribed by Miao, Zhengke; Wang, Xiaofeng; Zhang, Cun-Quan

Book ID: 127037718
Publisher: Elsevier Science
Year: 2015
Tongue: English
Weight: 404 KB
Volume: 43
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2014.08.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On -hued coloring of -minor free graphs

✍ Song, Huimin; Fan, Suohai; Chen, Ye; Sun, Lei; Lai, Hong-Jian 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 403 KB

Hamiltonian weights and unique 3-edge-co

Hamiltonian weights and unique 3-edge-colorings of cubic graphs

✍ Cun-Quan Zhang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 402 KB

## Abstract A (1,2)‐eulerian weight __w__ of a grph is hamiltonian if every faithful cover of __w__ is a set of two Hamilton circuits. Let __G__ be a 3‐connected cubic graph containing no subdivition of the Petersen graph. We prove that if __G__ admits a hamiltonian weight then __G__ is uniquely 3‐

Adjacent vertex-distinguishing edge colo

Adjacent vertex-distinguishing edge colorings of -minor free graphs

✍ Weifan Wang; Yiqiao Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 213 KB

List Colorings of K5-Minor-Free Graphs W

List Colorings of K5-Minor-Free Graphs With Special List Assignments

✍ Daniel W. Cranston; Anja Pruchnewski; Zsolt Tuza; Margit Voigt 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

The following question was raised by Bruce Richter. Let G be a planar, 3-connected graph that is not a complete graph. Denoting by d(v) the degree of vertex v, is G L-list colorable for every list assignment L with |L(v)|=min{d(v), 6} for all v ∈ V (G)? More generally, we ask for which pairs (r, k)