A classic example, the Four Colour Theorem, illustrates a fundamental property of planar graphs, while recent advancements have extended these ideas to more specialised variants, including list ...

While research on the geometry of planar graphs has been active in the past decades, many properties of planar metrics remain mysterious. This paper studies a fundamental aspect of the planar graph ...

A simple factor graph example with gtsam. It solves a simple planar SLAM problem based on an example in the gtsam library, and plots the marginal distributions mapped from the manifold onto the ...

Graph partitioning is an essential preprocessing step in distributed graph computation and scientific simulations. Existing well-studied graph partitioners are designed for static graphs, but ...

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