𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On minimally rainbow -connected graphs

✍ Scribed by Schiermeyer, Ingo

Book ID
123115915
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
180 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimally 3-connected graphs
Minimally 3-connected graphs
✍ Robin W Dawes πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 489 KB
On Minimally (n, Ξ»)-Connected Graphs
On Minimally (n, Ξ»)-Connected Graphs
✍ Atsushi Kaneko; Katsuhiro Ota πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 128 KB

A graph G is (n, \*)-connected if it satisfies the following conditions: (1) |V(G)| n+1; (2) for any subset S V(G) and any subset L E(G) with \* |S| +|L| <n\*, G&S&L is connected. The (n, \*)-connectivity is a common extension of both the vertex-connectivity and the edge-connectivity. An (n, 1)-conn

Note on Minimallyd-Rainbow Connected Gra
Note on Minimallyd-Rainbow Connected Graphs
✍ Hengzhe Li, Xueliang Li, Yuefang Sun, Yan Zhao πŸ“‚ Article πŸ“… 2013 πŸ› Springer Japan 🌐 English βš– 159 KB
On k-minimally n-edge-connected graphs
On k-minimally n-edge-connected graphs
✍ Stephen B. Maurer; Peter J. Slater πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 815 KB
Minimally restricted edge connected grap
Minimally restricted edge connected graphs
✍ Yanmei Hong; Qinghai Liu; Zhao Zhang πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 176 KB

For a connected graph G = (V, E), an edge set S βŠ‚ E is a restricted edge cut if G -S is disconnected and there is no isolated vertex in G -S. The cardinality of a minimum restricted edge cut of G is the restricted edge connectivity of G, denoted by Ξ» (G). , where ΞΎ(G) is the minimum edge degree of