✦ LIBER ✦

Rooted Spanning Trees in Tournaments

✍ Scribed by Xiaoyun Lu; Da-Wei Wang; Jiaofeng Pan; C. K. Wong

Publisher: Springer Japan
Year: 2000
Tongue: English
Weight: 192 KB
Volume: 16
Category: Article
ISSN: 0911-0119
DOI: 10.1007/pl00007227

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Onk-ary spanning trees of tournaments

✍ Lu, Xiaoyun; Wang, Da-Wei; Chang, Gerard J.; Lin, In-Jen; Wong, C. K. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

It is well known that every tournament contains a Hamiltonian path, which can be restated as that every tournament contains a unary spanning tree. The purpose of this article is to study the general problem of whether a tournament contains a k-ary spanning tree. In particular, we prove that, for any

Spanning subgraphs of a hypercube IV: Ro

Spanning subgraphs of a hypercube IV: Rooted trees

✍ Frank Harary; Martin Lewinter 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 303 KB

Independent spanning cycle-rooted trees

Independent spanning cycle-rooted trees in the cartesian product of digraphs

✍ Toru Hasunuma 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Trees in tournaments

✍ Frédéric Havet 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 350 KB

Trees in tournaments

✍ Roland Häggkvist; Andrew Thomason 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 396 KB

Ends in spanning trees

✍ Xingxing Yu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 97 KB

We refer to for terminology not specified here. Graphs mentioned in this note are undirected, simple. The following definition is due to Halin [l]: an end E of an infinite graph G is a set of l-way infinite paths in G such that P, Q E E iff for any finite subset R of V(G) there is a finite path in