Abstract
We prove (in two different ways) that in a sufficiently large tournament a vertex of outdegree at least two is always the beginning of an antidirected hamiltonian path starting with a forward arc. The proofs yield algorithms to find, if possible, an antidirected Hamiltonian path starting in a given vertex with an arc of a given direction. The first proof yields the theorem for all tournaments of order at least 19. The second proof only applies to somewhat larger tournaments, but leads to more efficient (sequential and parallel) algorithms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Bampis, I. Milis, Y. Manoussakis, NC algorithms for Antidirected Hamiltonian Paths and Cycles in tournaments, in Springer Verlag LNCS 903, Graph Theoretic Concepts in Computer Science WG'94, (E. W. Mayr et al eds.) 387–394; journal version to appear in JCMCC.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, MIT Press, 1990.
B. Grünbaum, Antidirected Hamiltonian paths in tournaments, J. Combin. Theory (B) 11 (1971) 249–257.
P. Hell and M. Rosenfeld, The complexity of finding generalized paths in tournaments, Journal of Algorithms 4 (1983) 303–309.
J. W. Moon, Topics on Tournaments, Holt, Reinhart and Winston, New York 1969.
V. Petrovic, Antidirected Hamiltonian circuits in tournaments, In Proc. 4th Yugoslavian Seminar of Graph Theory, pp. 259–269, Novi Sad, 1983.
K. B. Reid and E. T. Parker, Disproof of a conjecture of Erdös and Moser, J. Combin. Theory (B) 9 (1970) 93–99.
M. Rosenfeld, Antidirected Hamiltonian paths in tournaments, J. Combin. Theory (B) 12 (1972) 93–99.
M. Rosenfeld, Antidirected Hamiltonian circuits in tournaments, J. Combin. Theory (B) 16 (1974) 234–242.
C. Thomassen, Antidirected Hamiltonian circuits and paths in tournaments, Math. Ann. 201 (1973) 231–238.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bampis, E., Hell, P., Manoussakis, Y., Rosenfeld, M. (1996). Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament. In: Deza, M., Euler, R., Manoussakis, I. (eds) Combinatorics and Computer Science. CCS 1995. Lecture Notes in Computer Science, vol 1120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61576-8_75
Download citation
DOI: https://doi.org/10.1007/3-540-61576-8_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61576-7
Online ISBN: 978-3-540-70627-4
eBook Packages: Springer Book Archive