Lattices contained in planar orders are planar

DOI10.1007/BF01190783zbMath0778.05031OpenAlexW2019085620MaRDI QIDQ1208077

Ivan Rival, Jorge Urrutia, Richard J. Nowakowski

Publication date: 16 May 1993

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01190783

zbMATH Keywords

latticefinite ordered setplanar representationplanar covering graph

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

A property of connected subsets of an ordered set ⋮ Separability, boxicity, and partial orders ⋮ Bipartite graphs, upward drawings, and planarity ⋮ Obituary: Ivan Rival ⋮ Every triangle-free planar graph has a planar upward drawing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of planar ordered sets
• Is there a diagram invariant?
• Path length in the covering graph of a lattice
• Complexity of diagrams
• Bemerkungen zum Vierfarbenproblem
• Planar Lattices