𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degrees of Souslin Trees

✍ Scribed by Stefan Bilaniuk

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
692 KB
Volume
37
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Degree-preserving trees
Degree-preserving trees
✍ Broersma, Hajo; Koppius, Otto; Tuinstra, Hilde; Huck, Andreas; Kloks, Ton; Krats πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 186 KB

We consider the degree-preserving spanning tree (DPST) problem: Given a connected graph G G G, find a spanning tree T T T of G G G such that as many vertices of T T T as possible have the same degree in T T T as in G G G. This problem is a graph-theoretical translation of a problem arising in the sy

Packing k-edge trees in graphs of restri
Packing k-edge trees in graphs of restricted vertex degrees
✍ A.K. Kelmans πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 368 KB πŸ‘ 1 views

## Abstract Let ${\cal G}^{s}\_{r}$ denote the set of graphs with each vertex of degree at least __r__ and at most __s__, __v__(__G__) the number of vertices, and Ο„~__k__~ (__G__) the maximum number of disjoint __k__‐edge trees in __G__. In this paper we show that if __G__ ∈ ${\cal G}^{s}\_{2}$ a