𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Trees through specified vertices

✍ Scribed by J. Cutler

Book ID
108114060
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
530 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cycles through specified vertices
Cycles through specified vertices
✍ BΓ©la BollobΓ‘s; Graham Brightwell πŸ“‚ Article πŸ“… 1993 πŸ› Springer-Verlag 🌐 English βš– 552 KB
Edge disjoint cycles through specified v
Edge disjoint cycles through specified vertices
✍ Luis Goddyn; Ladislav Stacho πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 158 KB

## Abstract We give a sufficient condition for a simple graph __G__ to have __k__ pairwise edge‐disjoint cycles, each of which contains a prescribed set __W__ of vertices. The condition is that the induced subgraph __G__[__W__] be 2__k__‐connected, and that for any two vertices at distance two in _

Ak-Tree Containing Specified Vertices
Ak-Tree Containing Specified Vertices
✍ Shuya Chiba; Ryota Matsubara; Kenta Ozeki; Masao Tsugaki πŸ“‚ Article πŸ“… 2010 πŸ› Springer Japan 🌐 English βš– 578 KB