𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On ak-Tree Containing Specified Leaves in a Graph

✍ Scribed by Haruhide Matsuda; Hajime Matsumura

Publisher
Springer Japan
Year
2006
Tongue
English
Weight
132 KB
Volume
22
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On a Spanning Tree with Specified Leaves
On a Spanning Tree with Specified Leaves
✍ Yoshimi Egawa; Haruhide Matsuda; Tomoki Yamashita; Kiyoshi Yoshimoto πŸ“‚ Article πŸ“… 2008 πŸ› Springer Japan 🌐 English βš– 88 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

On spanning 2-trees in a graph
On spanning 2-trees in a graph
✍ Leizhen Cai πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 963 KB

A k-tree is either a complete graph on k vertices or a graph T that contains a vertex whose neighbourhood in T induces a complete graph on k vertices and whose removal results in a k-tree. A subgraph of a graph is a spanning k-tree if it is a k-tree and contains every vertex of the graph. This pape