𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On (s,t)-supereulerian graphs in locally highly connected graphs

✍ Scribed by Lan Lei; Xiaomin Li; Bin Wang; Hong-Jian Lai

Book ID
108114184
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
556 KB
Volume
310
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On weakly connected domination in graphs
On weakly connected domination in graphs
✍ Jean E. Dunbar; Jerrold W. Grossman; Johannes H. Hattingh; Stephen T. Hedetniemi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 497 KB

A weakly connected dominating set for a connected graph is a dominating set D of vertices of the graph such that the edges not incident to any vertex in D do not separate the graph. This paper considers the weakly connected domination number, 7w, and related domination parameters. It is shown that t

On the minimum local-vertex-connectivity
On the minimum local-vertex-connectivity augmentation in graphs
✍ Hiroshi Nagamochi; Toshimasa Ishii πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 179 KB

Given a graph G and target values r(u; v) prescribed for each pair of vertices u and v, we consider the problem of augmenting G by a smallest set F of new edges such that the resulting graph G+F has at least r(u; v) internally disjoint paths between each pair of vertices u and v. We show that the pr