✦ LIBER ✦

Ak-Tree Containing Specified Vertices

✍ Scribed by Shuya Chiba; Ryota Matsubara; Kenta Ozeki; Masao Tsugaki

Book ID: 106047839
Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 578 KB
Volume: 26
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0903-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On ak-Tree Containing Specified Leaves i

On ak-Tree Containing Specified Leaves in a Graph

✍ Haruhide Matsuda; Hajime Matsumura 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 132 KB

Trees through specified vertices

✍ J. Cutler 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 530 KB

On 2-factors with cycles containing spec

On 2-factors with cycles containing specified vertices in

✍ Yunshu Gao; Jin Yan; Guojun Li 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 340 KB

Cycles through specified vertices

✍ Béla Bollobás; Graham Brightwell 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 552 KB

Vertex-disjoint cycles containing specif

Vertex-disjoint cycles containing specified vertices in a bipartite graph

✍ Guantao Chen; Hikoe Enomoto; Ken-ichi Kawarabayashi; Katsuhiro Ota; Dingjun Lou; 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

## Abstract A minimum degree condition is given for a bipartite graph to contain a 2‐factor each component of which contains a previously specified vertex. © 2004 Wiley Periodicals, Inc. J Graph Theory 46: 145–166, 2004

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 _