Abstract
A natural and practical criterion in the preparation of diagrams of ordered sets is to minimize the number of different slopes used for the edges. For any diagram this is at least the maximum number of upper covers and of lower covers of any element. While this maximum degree is not always enough we show that it is as long as any edge joining a covering pair may be bent, to produce a crooked diagram.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Czyzowicz (1987) Lattice diagrams with few slopes, J. Combin. Th., to appear.
J.Czyzowicz, A.Pelc, and I.Rival (1990) Drawing orders with few slopes, Discr. Math. 82, 233–250.
D.Kelly and I.Rival (1975) Planar lattices, Canad. J. Math. 27, 636–665.
D. Kelly and W. T. Trotter (1982) Dimension theory for ordered sets, in Ordered Sets (I. Rival, ed.), D. Reidel, 171–211.
A. Pelc and I. Rival (1987) Orders with level diagrams, Europ. J. Combin., to appear.
C.Platt (1976) Planar lattices and planar graphs, J. Combin. Th. B 21, 30–39.
I. Rival (1978) Lattices and partially ordered sets, in Colloq. C.N.R.S. Prob. Comb. et Théorie des Graphes, Orsay, 260, 349–351.
B. Sands (1985) Problem 2.7 in Graphs and Order (I. Rival, ed.), D. Reidel, p. 531.
J. A. Storer (1980) The node-cost measure for embedding graphs in the planar grid, Proc. 12th ACM Symp. On Theory of Computing, 201–210.
R.Tamassia (1987) On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16(3), 421–444.
V. G.Vizing (1964) On an estimate of the chromatic class of a p-graph, Diskret. Analiz. 3, 25–30.
Author information
Authors and Affiliations
Additional information
Communicated by D. Kelly
Rights and permissions
About this article
Cite this article
Czyzowicz, J., Pelc, A., Rival, I. et al. Crooked diagrams with few slopes. Order 7, 133–143 (1990). https://doi.org/10.1007/BF00383762
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00383762