✦ LIBER ✦

Construction of Hamilton Path Tournament Designs

✍ Scribed by Yoshiko T. Ikebe; Akihisa Tamura

Publisher: Springer Japan
Year: 2011
Tongue: English
Weight: 259 KB
Volume: 27
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0998-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Antidirected Hamilton circuits and paths

Antidirected Hamilton circuits and paths in tournaments

✍ Carsten Thomassen 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 459 KB

Construction of all Hamiltonian paths in

Construction of all Hamiltonian paths in tournaments

✍ V. Ya. Burdyuk; A. A. Kakhichko; V. V. Shcherbak 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 376 KB

Path numbers of tournaments

✍ Brian Alspach; David W Mason; Norman J Pullman 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Powers of Hamilton cycles in tournaments

✍ Béla Bollobás; Roland Häggkvist 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 487 KB

The existence of court balanced tourname

The existence of court balanced tournament designs

✍ E. Mendelsohn; P. Rodney 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 564 KB

Let V be a set of n elements. A tournament design, TD(n, c), is a c-row array of the ("2) pairs of elements from V such that every element appears at most once is each column. A court balanced tournament design, CBTD(n,c), has the added property that every element appears the same number of times in

Parity of paths and circuits in tourname

Parity of paths and circuits in tournaments

✍ Rodney Forcade 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 393 KB