On polyhedral graphs and their complements

2021/02/22 by Maffucci, Riccardo Walter
#05C10 #05C30 #05C75 #51M20 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2102.11316

Abstract

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

Related

• Self-complementary (Pseudo-)Split Graphs
• On the structure of self-complementary graphs
• Trees in Polyhedral Graphs
• Classification of polyhedral graphs by numbers of common neighbours
• A family of non-Cayley cores based on vertex-transitive or strongly regular self-complementary graphs