Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Function Repository Resource:
Determine if a graph is polyhedral
ResourceFunction["PolyhedralGraphQ"][g] returns True if graph g is polyhedral. |
The tetrahedral graph is polyhedral:
In[1]:= | ![]() |
Out[1]= | ![]() |
The diamond graph is not polyhedral, since it can be disconnected by removing two edges:
In[2]:= | ![]() |
Out[2]= | ![]() |
The Petersen graph is not polyhedral since it is not planar:
In[3]:= | ![]() |
Out[3]= | ![]() |
All polyhedral graphs with 1 to 9 vertices, grouped by number of vertices, in "g6" format:
In[4]:= | ![]() |
Test the 257 polyhedral graphs with 8 vertices:
In[5]:= | ![]() |
Out[6]= | ![]() |
This work is licensed under a Creative Commons Attribution 4.0 International License