Circulant tournaments of prime order are tight
Authors:
- 28 December 2008
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 308 (24) , 6056-6063
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A class of tight circulant tournamentsDiscussiones Mathematicae Graph Theory, 2000
- The acyclic disconnection of a digraphDiscrete Mathematics, 1999
- Tight and Untight Triangulations of Surfaces by Complete GraphsJournal of Combinatorial Theory, Series B, 1995
- On the minimum size of tight hypergraphsJournal of Graph Theory, 1992
- On multipartite tournamentsJournal of Combinatorial Theory, Series B, 1991
- Cycles of Each Length in Regular TournamentsCanadian Mathematical Bulletin, 1967
- The Critical Pairs of Subsets of a Group of Prime OrderJournal of the London Mathematical Society, 1956