✦ LIBER ✦

Rainbow trees in graphs and generalized connectivity

✍ Scribed by Gary Chartrand; Futaba Okamoto; Ping Zhang

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connectivity keeping trees in k-connecte

Connectivity keeping trees in k-connected graphs

✍ W. Mader 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

We show that one can choose the minimum degree of a k-connected graph G large enough (independent of the vertex number of G) such that G contains a copy T of a prescribed tree with the property that G -V (T ) remains k-connected.

Connectivity and diameter in distance gr

Connectivity and diameter in distance graphs

✍ Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

Extremal connectivity and vulnerability

Extremal connectivity and vulnerability in graphs

✍ Lynne L. Doty 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB

Distance connectivity in graphs and digr

Distance connectivity in graphs and digraphs

✍ Balbuena, M. C.; Carmona, A.; Fiol, M. A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 642 KB

Let G = ( V , A ) be a digraph with diameter D # 1. For a given integer 2 5 t 5 D , the t-distance connectivity K ( t ) of G is the minimum cardinality of an z --+ y separating set over all the pairs of vertices z, y which are a t distance d(z, y) 2 t. The t-distance edge connectivity X ( t ) of G i

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

Generalized Parking Functions, Tree Inve

Generalized Parking Functions, Tree Inversions, and Multicolored Graphs

✍ Catherine H. Yan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 272 KB

A generalized x-parking function associated to a positive integer vector of the form a b b b is a sequence a 1 a 2 a n of positive integers whose The set of x-parking functions has the same cardinality as the set of sequences of rooted b-forests on n . We construct a bijection between these two set