✦ LIBER ✦

On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms

✍ Scribed by Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou

Book ID: 120910017
Publisher: Springer
Year: 2012
Tongue: English
Weight: 726 KB
Volume: 67
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-012-9689-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The (strong) rainbow connection numbers

The (strong) rainbow connection numbers of Cayley graphs on Abelian groups

✍ Hengzhe Li; Xueliang Li; Sujuan Liu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 248 KB

A note on the minimum size of k-rainbow-

A note on the minimum size of k-rainbow-connected graphs

✍ Lo, Allan 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 334 KB

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

On the complexity of partitioning graphs

On the complexity of partitioning graphs into connected subgraphs

✍ M.E. Dyer; A.M. Frieze 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 897 KB

On the connectivity and restricted edge-

On the connectivity and restricted edge-connectivity of 3-arc graphs

✍ Balbuena, C.; García-Vázquez, P.; Montejano, L.P. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 499 KB

On the distance connectivity of graphs a

On the distance connectivity of graphs and digraphs

✍ M.A. Fiol; J. Fàbrega 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Let G=( V, E) be a digraph with diameter D # 1. For a given integer 1 t. The t-distance edge-connectivity of G is defined analogously. This paper studies some results on the distance connectivities of digraphs and bipartite digraphs. These results are given in terms of the parameter I, which can be