On polyhedral graphs and their complements

DOI10.1007/s00010-022-00902-5zbMath1497.05056arXiv2102.11316OpenAlexW3129232407MaRDI QIDQ2172835

Riccardo W. Maffucci

Publication date: 16 September 2022

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.11316

zbMATH Keywords

classificationpolyhedraplanar graphscomplementsdual graph3-connectivity

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Polyhedra and polytopes; regular figures, division of spaces (51M20) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polyhedra with 4 to 8 faces
• Polyhedra of small order and their Hamiltonian properties
• A remark on the connectivity of the complement of a 3-connected graph
• On planar greedy drawings of 3-connected planar graphs
• Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
• Fourth class of convex equilateral polyhedron with polyhedral symmetry related to fullerenes and viruses
• Steinitz Theorems for Orthogonal Polyhedra
• The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
• Every planar graph with nine points has a nonplanar complement

This page was built for publication: On polyhedral graphs and their complements