Abstract
In abstract algebra courses, teachers are often confronted with the task of drawing subgroup lattices. For purposes of instruction, it is usually desirable that these lattices be planar graphs (with no crossings). We present a characterization of abelian groups with this property. We also resolve the following problem in the abelian case: if the subgroup lattice is required to be drawn hierarchically (that is, in monotonic order of index within the group), when is it possible to draw the lattice without crossings?
Author supplied keywords
Cite
CITATION STYLE
Starr, C. L., & Turner, G. E. (2004). Planar groups. Journal of Algebraic Combinatorics, 19(3), 283–295. https://doi.org/10.1023/B:JACO.0000030704.77583.7b
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.