𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Spanning trees of 3-uniform hypergraphs

✍ Scribed by Andrew Goodall; Anna de Mier

Book ID
113411308
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
436 KB
Volume
47
Category
Article
ISSN
0196-8858

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Partitioning 3-uniform hypergraphs
Partitioning 3-uniform hypergraphs
✍ Jie Ma; Xingxing Yu πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 291 KB
Most and least uniform spanning trees
Most and least uniform spanning trees
✍ Paolo M. Camerini; Francesco Maffioli; Silvano Martello; Paolo Toth πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 708 KB
On finding most uniform spanning trees
On finding most uniform spanning trees
✍ Zvi Galil; Baruch Schieber πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 243 KB
Matchings in 3-uniform hypergraphs
Matchings in 3-uniform hypergraphs
✍ KΓΌhn, Daniela; Osthus, Deryk; Treglown, Andrew πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 271 KB