Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 26 edges. Results have been checked with the number of rooted c-nets of R. C.

Graph colouring remains a central topic in graph theory, providing the mathematical framework for assigning colours to the elements of a graph under specific constraints. In particular, the colouring ...

The weighted maximal planar graph (WMPG) is practically important in the laying out of facilities in modern manufacturing environments. Given a weighted complete graph, the WMPG seeks to find a ...

In the latest verse of a centuries-old mathematical refrain, scientists have figured a way to iron out the wrinkles in a large class of molecular cages. The cages have faces consisting of 12 regular ...