Abstract
A local tournament is a digraph in which the out-set as well as the in-set of every vertex is a tournament. These digraphs have recently been found to share many desirable properties of tournaments. We illustrate this by giving O(m+n logn) algorithms to find a hamiltonian path and cycle in a local tournament. We mention several characterizations and recognition algorithms of graphs orientable as local tournaments. It turns out that they are precisely the graphs previously studied as proper circular arc graphs. Thus we obtain new recognition algorithms for proper circular arc graphs. We also give a more detailed structural characterization of chordal graphs that are orientable as local tournaments, i.e., that are proper circular arc graphs.
Partially supported by grants from NSERC and ASI. Most of this paper was written while the first two authors were visiting the Laboratoire de Recherche en Informatique, Universite de Paris-Sud, whose hospitality is gratefully acknowledged.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Apostolico and S. E. Hambrusch, Finding maximum cliques on circular arc graphs, Information Processing Letters 26 (1987) 209–215.
J. Bang-Jensen, Locally semicomplete digraphs, J. Graph Theory, to appear.
M. A. Bonuccelli, Dominating sets and domatic number of circular arc graphs, Discrete Applied Math. 12 (1985) 203–213.
M. A. Bonuccelli and D. P. Bovet, Minimum disjoint path covering for circular arc graphs, Information Processing Letters 8 (1979) 159–161.
M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press 1980.
M. C. Golumbic and P. L. Hammer, Stability in circular arc graphs, J. Algorithms 9 (1988), 314–320.
U. I. Gupta, D. T. Lee, J. Y.-T. Leung, Efficient algorithms for interval graphs and circular arc graphs, Networks 12 (1982) 459–467.
P. Hell and M. Rosenfeld, The complexity of finding generalized paths in tournaments, J. Algorithms 4 (1983) 303–309.
J. Huang, A result on local tournaments, unpublished manuscript, 1989.
D. Knuth, Art of Computer Programming, v.3, Sorting and Searching, Addison-Wesley, 1973.
Y. Manoussakis, A linear algorithm for finding hamiltonian cycles in tournaments., Rapport de recherche 488, 1989, Laboratoire de Recherche en Informatique, Universite de Paris — Sud.
F. S. Roberts, Indifference graphs, in Proof techniques in Graph Theory (F. Harary ed.), pp. 139–146; Academic Press, 1969.
D. J. Skrien, A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular arc graphs, and nested interval graphs, J. Graph Theory 6 (1982) 309–316.
A. Teng and A. Tucker, An O(qn) algorithm to q-color a proper family of circular arcs, Discrete Math. 55 (1985) 233–243.
A. Tucker, Coloring a family of circular arcs, SIAM J. Appl. Math. 29 (1975) 493–502.
A. Tucker, Structure theorems for some circular arc graphs, Discrete Math. 7 (1974) 167–195.
A. Tucker, Matrix characterizations of circular arc graphs, Pacific J. Math. 39 (1971) 535–545.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hell, P., Bang-Jensen, J., Huang, J. (1990). Local tournaments and proper circular arc graphs. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds) Algorithms. SIGAL 1990. Lecture Notes in Computer Science, vol 450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52921-7_59
Download citation
DOI: https://doi.org/10.1007/3-540-52921-7_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52921-7
Online ISBN: 978-3-540-47177-6
eBook Packages: Springer Book Archive