Generation of $3$-connected, planar line graphs
Combinatorics
2024-04-12 v1
Abstract
We classify and construct all line graphs that are -polytopes (planar and -connected). Apart from a few special cases, they are all obtained starting from the medial graphs of cubic (i.e., -regular) -polytopes, by applying two types of graph transformations. This is similar to the generation of other subclasses of -polytopes.
Keywords
Cite
@article{arxiv.2404.07819,
title = {Generation of $3$-connected, planar line graphs},
author = {Phoebe Hollowbread-Smith and Riccardo W. Maffucci},
journal= {arXiv preprint arXiv:2404.07819},
year = {2024}
}