Edge-disjoint trees containing some given vertices in a graph

37Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

We show that for any two natural numbers k,ℓ there exist (smallest natural numbers fℓ(k)(gℓ(k)) such that for any fℓ(k)-edge-connected (gℓ(k)-edge-connected) vertex set A of a graph G with A ≤ℓ( V(G) - A ≤ℓ) there exists a system of k edge-disjoint trees such that A⊆V(T) for each T ∈. We determine f3(k) = ⌊8k+3/6⌋. Furthermore, we determine for all natural numbers ℓ,k the smallest number, fℓ*(k) such that every fℓ*(k -edge-connected graph on at most ℓ vertices contains a system of k edge-disjoint spanning trees, and give applications to line graphs. © 2003 Published by Elsevier Science (USA).

Cite

CITATION STYLE

APA

Kriesell, M. (2003). Edge-disjoint trees containing some given vertices in a graph. Journal of Combinatorial Theory. Series B, 88(1), 53–65. https://doi.org/10.1016/S0095-8956(02)00013-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free