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 ...
Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on ℤ 2 is SLE 2 . We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback