✦ LIBER ✦

An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph

✍ Scribed by Zhang, Lianzhu; Wang, Weifan; Lih, Ko-Wei

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the adjacent vertex d

✍ Xin-sheng Liu; Ming-qiang An; Yang Gao 📂 Article 📅 2008 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 159 KB

Upper bounds on vertex distinguishing ch

✍ Jun-qiao Zhu, Yue-hua Bu 📂 Article 📅 2012 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 281 KB

A note on the adjacent vertex distinguis

✍ Danjun Huang; Weifan Wang; Chengchao Yan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 186 KB

An improved upper bound for the neighbor

✍ Wang, Guanghui; Yan, Guiying 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 301 KB

On the adjacent vertex-distinguishing to

✍ Haiying Wang 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 466 KB

An improved bound on acyclic chromatic i

✍ Guan, Yue; Hou, Jianfeng; Yang, Yingyuan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 393 KB