We classify and construct all line graphs that are $3$-polytopes (planar and $3$-connected). Apart from a few special cases, they are all obtained starting from the medial graphs of cubic (i.e., $3$-regular) $3$-polytopes, by applying two types of graph transformations. This is similar to the generation of other subclasses of $3$-polytopes.
No takes yet. Share an insight, caveat, or question.
Hollowbread-Smith et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: