✦ LIBER ✦

Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree

✍ Scribed by Dong, Ai Jun; Wang, Guang Hui

Book ID: 125352522
Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2014
Tongue: English
Weight: 242 KB
Volume: 30
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-014-2454-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Neighbor sum distinguishing edge colorin

✍ Dong, Aijun; Wang, Guanghui; Zhang, Jianghua 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Neighbor sum distinguishing total colori

✍ Li, Hualong; Ding, Laihao; Liu, Bingqiang; Wang, Guanghui 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 227 KB

Adjacent vertex distinguishing edge-colo

✍ Weifan Wang; Yiqiao Wang 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 406 KB

Vertex-Distinguishing Edge Colorings of

✍ Bin Liu; Guizhen Liu 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 183 KB

Total colorings of planar graphs with la

✍ Borodin, O. V.; Kostochka, A. V.; Woodall, D. R. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 3 views

It is proved that a planar graph with maximum degree ∆ ≥ 11 has total (vertex-edge) chromatic number ∆ + 1.

Sum Coloring of Bipartite Graphs with Bo

✍ Michal Malafiejski; Krzysztof Giaro; Robert Janczewski; Marek Kubale 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 580 KB