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

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

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...

This project is aimed to draw a triangulation on a plane. The current tools, such as networkx, perform not well, so this is why this project emerges. A ring in a planar graph is a closed walk, both of ...

If G is a planar graph, we may add edges to construct a maximal planar graph H containing G, so that H triangulates the sphere. If G is toroidal, then by adding edges we can extend G to a maximal ...