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

A graph is planar if it can be drawn in the plane in such a way that no edges intersect, except of course at a common endvertex. Planar graphs corresponding to the regular polyhedra and other ...

This paper deals with two- and threefold weavings on Platonic polyhedral surfaces. Depending on the skewness of the weaving pattern with respect to the edges of the polyhedra, different numbers of ...