✦ LIBER ✦

Balancing two spanning trees

✍ Scribed by Matthias Kriesell

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 80 KB
Volume: 57
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20405

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Do nearly balanced multigraphs have more

Do nearly balanced multigraphs have more spanning trees?

✍ Ching-Shui Cheng; Joseph C. Masaro; Chi Song Wong 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 320 KB

We prove that, with very few exceptions, every graph of order n, n = 0, 1 (mod 4) and size a t most n -1, is contained in a self-complementary graph of order n. We study a similar problem for digraphs. Throughout the paper, G and D will denote a finite graph and a finite digraph, respectively, with

Minimal ratio spanning trees

✍ R. Chandrasekaran 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 323 KB

Spanning trees with many leaves

✍ Guoli Ding; Thor Johnson; Paul Seymour 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB

## Abstract We show that if __G__ is a simple connected graph with and $|V(G)| \,\neq\,t+2$, then __G__ has a spanning tree with > __t__ leaves, and this is best possible. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 189–197, 2001

Counting Minimum Weight Spanning Trees

✍ Andrei Z. Broder; Ernst W. Mayr 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 152 KB

We present an algorithm for counting the number of minimum weight spanning trees, based on the fact that the generating function for the number of spanning trees of a given graph, by weight, can be expressed as a simple determinant. For a graph with n vertices and m edges, our Ž Ž .. Ž . algorithm r

Scaling limits for minimal and random sp

Scaling limits for minimal and random spanning trees in two dimensions

✍ Michael Aizenman; Almut Burchard; Charles M. Newman; David B. Wilson 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB

A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in ‫ޒ‬ d . Tightness of the distribution, as ␦ ª 0, is establi

Infinite, highly connected digraphs with

Infinite, highly connected digraphs with no two arc-disjoint spanning trees

✍ Ron Aharoni; Carsten Thomassen 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB