arXiv Analytics

Sign in

arXiv:2404.07819 [math.CO]AbstractReferencesReviewsResources

Generation of $3$-connected, planar line graphs

Phoebe Hollowbread-Smith, Riccardo W. Maffucci

Published 2024-04-11Version 1

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.

Related articles: Most relevant | Search more
arXiv:1908.11622 [math.CO] (Published 2019-08-30)
Generation of Local Symmetry-Preserving Operations
arXiv:1207.7010 [math.CO] (Published 2012-07-30, updated 2012-10-16)
The Generation of Fullerenes
arXiv:1803.01931 [math.CO] (Published 2018-03-05)
Structure and generation of crossing-critical graphs