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 ...

Planar graph algorithms constitute a pivotal area in theoretical computer science, addressing problems where graphs can be drawn on a plane without edge crossings. Among the myriad challenges in this ...

In the first paper, Alexandrov's Theorem was studied, and extended, to show that convex polyhedra form statically rigid frameworks in space, when built with plane-rigid faces. This second paper ...