2024/04/11 by Phoebe Hollowbread-Smith, Hollowbread-Smith, Phoebe, Riccardo W. Maffucci +1 · 1 citation
Computer Science · Engineering · #05C10 #05C40 #05C75 #05C76 #52B05 #52B10 #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Model-Driven Software Engineering Techniques #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2404.07819
openalex publication_date 2024/04/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.