Abstract
The covering graph of a lattice which is contained in an ordered set with a planar covering graph is itself planar.
Similar content being viewed by others
References
Duffus, D. andRival, I.,Path length in the covering graph of a lattice. Discrete Math.19 (1977), 139–158.
Fáry, I.,On straight line representation of planar graphs. Acta Sci. Math. Szeged11 (1948), 229–233.
Jégou, R., Nowakowski, R. andRival, I.,The diagram invariant problem for planar lattices. Acta Sci. Math.51 (1987), 103–121.
Kelly, D.,Fundamentals of planar ordered sets. Discrete Math.63 (1987), 197–216.
Kelly, D. andRival, I.,Planar lattices. Canad. J. Math.27 (1975), 626–665.
Nešetřil, J. andRödl, V.,Complexity of diagrams. Order3 (1987), 321–330.
Nowakowski, R. andRival, I.,Embedding orders along three channels, to appear.
Pouzet, M. andRival, I.,Is there a diagram invariant? Discrete Math.73 (1988), 181–188.
Rival, I.,The diagram. Order2 (1985), 101–104.
Rival, I.,The diagram, inGraphs-and Order (I. Rival, ed.). D. Reidel Publ., pp. 103–133.
Rival, I.,Graphical data structures for ordered sets, inAlgorithms and Order (I. Rival, ed.) D. Reidel Publ., 1989, pp. 3–31.
Wagner, K.,Bemerkungen zum Vierfarbenproblem. Jber. Deutsch. Math. Verein.46 (1936), 26–32.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nowakowski, R., Rival, I. & Urrutia, J. Lattices contained in planar orders are planar. Algebra Universalis 29, 580–588 (1992). https://doi.org/10.1007/BF01190783
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01190783