✦ LIBER ✦

Rainbow vertex -connection in graphs

✍ Scribed by Liu, Henry; Mestre, Ângela; Sousa, Teresa

Book ID: 122986504
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 683 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.04.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Further hardness results on the rainbow

Further hardness results on the rainbow vertex-connection number of graphs

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

Tight upper bound of the rainbow vertex-

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

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

Rainbow Connection in 3-Connected Graphs

✍ Xueliang Li, Yongtang Shi 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 242 KB

Connected vertex covers in dense graphs

✍ Jean Cardinal; Eythan Levy 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 388 KB

Vertex suppression in 3-connected graphs

✍ Matthias Kriesell 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

## Abstract To __suppress__ a vertex $v$ in a finite graph __G__ means to delete it and add an edge from __a__ to __b__ if __a__, __b__ are distinct nonadjacent vertices which formed the neighborhood of $v$. Let $G--x$ be the graph obtained from $G-x$ by suppressing vertices of degree at most 2 as

On Isoperimetric Connectivity in Vertex-

On Isoperimetric Connectivity in Vertex-Transitive Graphs

✍ Hamidoune, Y. O.; Lladó, A. S.; Serra, O.; Tindell, R. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 241 KB