Abstract
This paper is devoted to the study of contiguity orders i.e. orders having a linear extension L such that all upper (or lower) cover sets are intervals of L. This new class appears to be a strict generalization of both interval orders and N-free orders, and is linearly recognizable. It is proved that computing the number of contiguity extensions is #P-complete, and that the dimension of height one contiguity orders is polynomially tractable. Moreover the membership is a comparability invariant on bi-contiguity orders.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.S. Booth, G.S. Lueker, Testing for the Consecutive Ones Property, Interval Graphs and Graph Planarity Using PQ-Tree Algorithms. Journal of Computer and System Science 13, 335–379 (1976).
V. Bouchitté, R. Jégou, J.X. Rampon, Ordres représentables par des translations de segments dans le plan. C.R. Acad. Sci. Paris, t. 315, Série I, p. 1427–1430, 1992.
V. Bouchitté, R. Jégou, J.X. Rampon, Line-Directionality of Orders. Order 10: 17–30, 1993.
A. Brandstädt, The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions. Lecture Notes in Computer Science N∘ 380, pp. 68–77, Springer-Verlag 1990.
G. Brightwell, P. Winkler Counting Linear Extensions. Order 8: 225–242, 1991.
E. Dahlhaus, The Computation of the Jump Number of Convex Graphs. Lecture Notes in Computer Science N∘ 831, pp. 176–185, Springer-Verlag 1994.
B. Dreesen, W. Poguntke, P. Winkler Comparability Invariance of the Fixed Point Property. Order 2: 269–274, 1985.
P. Duchet, Représentations, noyaux en théorie des graphes et hypergraphes. Doctorat d'État ès Science Paris VI, 1979.
M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
M. Habib, R. Jégou, N-free Posets as Generalizations of Series-Parallel Posets. Discrete Applied Mathematics 12 (1985) 279–291.
D. Kelly, Comparability Graphs. I. Rival (ed.), Graphs and Order, 3–40. 1985 by D.Reidel Publishing Company.
D. Kelly, I. Rival, Planar Lattices. Canadian Journal of Mathematics, Vol. XXVII N∘ 3, (1975), 636–665.
H.A. Kierstead, S.G. Penrice, Computing the Dimension of N-Free Ordered Sets is NP-complete. Order 6: 133–136, 1989.
J. Mitas, Tackling the Jump Number of Interval Orders. Order 8: 115–132. 1991.
R.H. Möhring, Computationally Tractable Classes of Ordered Sets. I. Rival (ed.), Algorithms and Order, 105–193. 1989 by Kluwer Academic Publishers.
A. Quilliot, S.X. Chao, Algorithmic Characterizations of Interval Ordered Hypergraphs and Applications. Discrete Applied Mathematics 51 (1994) 159–170.
I. Rival et J. Urrutia, Representing Orders on the Plane by Translating Convex Figures. Order 4: 319–339, 1988.
J. Spinrad, On Comparability and Permutation Graphs. SIAM Journal of Computing Vol. 14, N∘ 3, August 1985, 658–670.
J. Spinrad, Private communication.
J. Spinrad, A. Brandstädt, L. Stewart, Bipartite Permutation Graphs. Discrete Applied Mathematics 18 (1987) 279–292.
W.T. Trotter, Combinatorics and Partially Ordered Sets, Dimension Theory. The Johns Hopkins University Press, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouchitté, V., Hilali, A., Jégou, R., Rampon, JX. (1996). Contiguity orders. 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_89
Download citation
DOI: https://doi.org/10.1007/3-540-61576-8_89
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