Cycles of all lengths in arc-3-cyclic semicomplete digraphs
- MathematicsDiscret. Math.
On arc-traceable tournaments
A digraph D = (V, A) is arc-traceable if for each arc xy in A, xy lies on a directed path containing all the vertices of V, that is, a hamiltonian path. Given a tournament T, it is well known that it…
On arc‐traceable tournaments
- MathematicsJ. Graph Theory
It is shown that non-arc-traceable tournaments have a specific structure, and several sufficient conditions for strong tournaments to be arctraceable, including Dirac-like minimum degree conditions, Ore-like conditions, and irregularity conditions.
Path-connect iv i ty in local tournaments 1
A digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors as well as the set of out-neighbors of x induce tournaments. We give characterizations of generalized…
Local tournaments and in-tournaments
Preface Tournaments constitute perhaps the most well-studied class of directed graphs. One of the reasons for the interest in the theory of tournaments is the monograph Topics on Tournaments  by…
Locally semicomplete digraphs: A generalization of tournaments
- MathematicsJ. Graph Theory
The class of underlying graphs of the locally semi-complete digraphs is precisely the class of proper circular-arc graphs (see , Theorem 3), and it is shown that many of the classic theorems for tournaments have natural analogues for locally semicompleteDigraphs.
Tournaments and Semicomplete Digraphs
- MathematicsClasses of Directed Graphs
This chapter covers a very broad range of results on tournaments and semicomplete digraphs from classical to very recent ones and gives a number of proofs which illustrate the diversity of proof techniques that have been applied.
SHOWING 1-9 OF 9 REFERENCES
Cycles of Each Length in Regular Tournaments
- MathematicsCanadian Mathematical Bulletin
It is known that a strong tournament of order n contains a cycle of each length k, k=3,…, n, ([l], Thm. 7). Moon  observed that each vertex in a strong tournament of order n is contained in a…
ON THE STRONG PATH CONNECTIVITY OF A TOURNAMENT
B. Alspach has shown that an irregular tournament T=(V,A) is arc-pancyclic. The purpose of this paper is to give a sufficient condition by which it can be verified that when p≥7, for any arc (v,…
A NECESSARY AND SUFFICIENT CONDITION FOR ARC-PANCYCLICITY OF TOURNAMENTS
In this paper, it is proved that a tournament T with p vertices has are-pancyclicity, if andonly if T has both 3-are-cyclicity and p-are-cyclicity.
Cycles of each length in a certain kind of tournament
- Sci. Sinica
Cycles and Paths in Tournaments,
- Thesis, University of Aarhus, Denmark,
A kind of counterexample on arc-pancyclic tournaments
- Acra Math. Appl. Sinica
BEINEKE, Tournaments, in “Selected Topics in Graph Theory
Chemins et circuits Hamiltoniens des graphes complets
- C. R. Acad. Sci. Paris, S&r. A-B