✦ LIBER ✦

Realization of certain generalized paths in tournaments

✍ Scribed by Brian Alspach; Moshe Rosenfeld

Book ID: 107748364
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 467 KB
Volume: 34
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90068-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of finding generalized pa

The complexity of finding generalized paths in tournaments

✍ Pavol Hell; Moshe Rosenfeld 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Parity of paths and circuits in tourname

Parity of paths and circuits in tournaments

✍ Rodney Forcade 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 393 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

The maximum number of Hamiltonian paths

The maximum number of Hamiltonian paths in tournaments

✍ Noga Alon 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 245 KB

Transitive partitions in realizations of

Transitive partitions in realizations of tournament score sequences

✍ Arthur H. Busch; Guantao Chen; Michael S. Jacobson 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

## Abstract A tournament is an oriented complete graph, and one containing no directed cycles is called __transitive__. A tournament __T__=(__V, A__) is called __m__‐__partition transitive__ if there is a partition such that the subtournaments induced by each __X__~__i__~ are all transitive, an

The Path Partition Conjecture is true fo

The Path Partition Conjecture is true for some generalizations of tournaments

✍ Alan Arroyo; Hortensia Galeana-Sánchez 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 253 KB