## 18 Citations

### On arc-traceable tournaments

- Mathematics
- 2006

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
- 2006

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

- Mathematics
- 2002

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

- Mathematics
- 2007

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 [58] by…

### Locally semicomplete digraphs: A generalization of tournaments

- MathematicsJ. Graph Theory
- 1990

The class of underlying graphs of the locally semi-complete digraphs is precisely the class of proper circular-arc graphs (see [13], 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
- 2018

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.

## References

SHOWING 1-9 OF 9 REFERENCES

### Cycles of Each Length in Regular Tournaments

- MathematicsCanadian Mathematical Bulletin
- 1967

It is known that a strong tournament of order n contains a cycle of each length k, k=3,…, n, ([l], Thm. 7). Moon [2] observed that each vertex in a strong tournament of order n is contained in a…

### ON THE STRONG PATH CONNECTIVITY OF A TOURNAMENT

- Mathematics
- 1979

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

- Mathematics
- 1982

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
- 1981

### Cycles and Paths in Tournaments,

- Thesis, University of Aarhus, Denmark,
- 1972

### A kind of counterexample on arc-pancyclic tournaments

- Acra Math. Appl. Sinica
- 1983

### BEINEKE, Tournaments, in “Selected Topics in Graph Theory

- 1979

### Chemins et circuits Hamiltoniens des graphes complets

- C. R. Acad. Sci. Paris, S&r. A-B
- 1959