On polyhedral graphs and their complements

DOI10.1007/S00010-022-00902-5MaRDI QIDQ2172835zbMATH OpenOpenAlexFDO

Authors Riccardo W. Maffucci

Publication date 16 September 2022

Published in Aequationes Mathematicae (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

3-connectivityclassificationcomplementsdual graphplanar graphspolyhedra

Mathematics Subject Classification ID

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

Abstract: We find all polyhedral graphs such that their complements are still polyhedral. These turn out to be all self-complementary.

Cites work

• A remark on the connectivity of the complement of a 3-connected graph
• Enumeration of unlabeled graphs such that both the graph and its complement are 2-connected
• Every planar graph with nine points has a nonplanar complement
• Fourth class of convex equilateral polyhedron with polyhedral symmetry related to fullerenes and viruses
• scientific article; zbMATH DE number 3166039 (Why is no real title available?)
• scientific article; zbMATH DE number 5294801 (Why is no real title available?)
• scientific article; zbMATH DE number 37833 (Why is no real title available?)
• scientific article; zbMATH DE number 867627 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• On planar greedy drawings of 3-connected planar graphs
• Polyhedra of small order and their Hamiltonian properties
• Polyhedra with 4 to 8 faces
• Straight-line grid drawings of 3-connected 1-planar graphs
• The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3

Cited in

(9)

• On the combinatorics of the graph-complex.
• On coindices of graphs and their complements
• The graphs behind reuleaux polyhedra
• The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)
• scientific article; zbMATH DE number 3906512 (Why is no real title available?)
• Characterising \(3\)-polytopes of radius one with unique realisation
• Generation of 3-connected, planar line graphs
• 3-triangulations of polyhedra and their connection graphs
• Graphs of polyhedra; polyhedra as graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172835)