✦ LIBER ✦

The rainbow connectivity of a graph

✍ Scribed by Gary Chartrand; Garry L. Johns; Kathleen A. McKeon; Ping Zhang

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 140 KB
Volume: 54
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20296

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The rainbow connection of a graph is (at

The rainbow connection of a graph is (at most) reciprocal to its minimum degree

✍ Michael Krivelevich; Raphael Yuster 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

## Abstract An edge‐colored graph __G__is __rainbow edge‐connected__ if any two vertices are connected by a path whose edges have distinct colors. The __rainbow connection__ of a connected graph __G__, denoted by __rc__(__G__), is the smallest number of colors that are needed in order to make __G__

Rainbow trees in graphs and generalized

Rainbow trees in graphs and generalized connectivity

✍ Gary Chartrand; Futaba Okamoto; Ping Zhang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB

Local connectivity of a random graph

✍ P. Erdös; E. M. Palmer; R. W. Robinson 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

## Abstract A graph is locally connected if for each vertex ν of degree __≧2__, the subgraph induced by the vertices adjacent to ν is connected. In this paper we establish a sharp threshold function for local connectivity. Specifically, if the probability of an edge of a labeled graph of order __n_

On the edge-connectivity vector of a gra

On the edge-connectivity vector of a graph

✍ Linda M. Lesniak; Raymond E. Pippert 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

The Connectivities of Leaf Graphs of 2-C

The Connectivities of Leaf Graphs of 2-Connected Graphs

✍ Atsushi Kaneko; Kiyoshi Yoshimoto 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Given a connected graph G, denote by V the family of all the spanning trees of G. Define an adjacency relation in V as follows: the spanning trees t and t$ are said to be adjacent if for some vertex u # V, t&u is connected and coincides with t$&u. The resultant graph G is called the leaf graph of G.

Non-rainbow colorings of 3-, 4- and 5-co

Non-rainbow colorings of 3-, 4- and 5-connected plane graphs

✍ Zdeněk Dvořák; Daniel Král'; Riste Škrekovski 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 1 views

## Abstract We study vertex‐colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If __G__ is a 3 ‐connected plane graph with __n__ vertices, then the number of colors in such a coloring does not exceed $\lfloor{{7n-8}\over {9}}\rfloo