Planar lattices and planar graphs
Journal of Combinatorial Theory Series BPublished 1 August 1976
Craig Platt
Citations69
SJR quartileQ1
SJR score2.31
SNIP1.83
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is shown that a finite lattice is planar if and only if the graph obtained from its (Hasse) diagram by adding an edge between its least and greatest elements is a planar graph.
Abstract
It is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by adding an edge between its least and greatest elements is a planar graph.
Keywords
Computer ScienceMathematicsEngineering