✦ LIBER ✦

Bypaths in tournaments

✍ Scribed by Yubao Guo; Lutz Volkmann

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 559 KB
Volume: 79
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00038-3

No coin nor oath required. For personal study only.

✦ Synopsis

If every arc of a 3-connected tournament T is contained in a cycle of length 3, then every arc of T has a bypath of length k for each k > 3, unless T is isomorphic to two tournaments, each of which has exactly 8 vertices. This extends the corresponding result for regular tournaments, due to Alspach, Reid and Roselle (1974).

📜 SIMILAR VOLUMES

Covering relations, closest orderings an

Covering relations, closest orderings and hamiltonian bypaths in tournaments

✍ Jeffrey S. Banks; Georges Bordes; Michel Breton 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 541 KB

Embedding tournaments in simple tourname

Embedding tournaments in simple tournaments

✍ J.W. Moon 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 693 KB

A tournament is simple if the corresp(!nding reEationa1 system is simple in the alge brnlc ~nse. it ir sh~un that cony F~~utnmlent T,, with IT nodes can be embedded in in simple tourrramant r \*+ 1 apart from two exceptional types of tournaments which can be embeddecl rn a %impie Fournczmtn t TR+ 1.

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

Even tournaments and Hadamard tournament

Even tournaments and Hadamard tournaments

✍ Noboru Ito 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 309 KB

We discuss several tournaments. results and problems of even tournaments and Hadamard

In-Tournament Digraphs

✍ J. Bangjensen; J. Huang; E. Prisner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 859 KB