✦ LIBER ✦

Tight upper bound of the rainbow vertex-connection number for 2-connected graphs

✍ Scribed by Li, Xueliang; Liu, Sujuan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A sharp upper bound for the rainbow 2-co

✍ Li, Xueliang; Liu, Sujuan 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Upper Bounds for the Rainbow Connection

✍ Xueliang Li; Yuefang Sun 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 462 KB

The rainbow connection number of 2-conne

✍ Ekstein, Jan; Holub, Přemysl; Kaiser, Tomáš; Koch, Maria; Camacho, Stephan Matos 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Upper bound involving parameterσ2for the

✍ Dong, Jiu-ying; Li, Xue-liang 📂 Article 📅 2013 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 175 KB

Polynomial algorithm for sharp upper bou

✍ Xing-Chao Deng; Kai-Nan Xiang; Baoyindureng Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 334 KB

Further hardness results on the rainbow

✍ Chen, Lily; Li, Xueliang; Lian, Huishu 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 372 KB