For a fixed graph H, the H-Recoloring problem asks whether for two given...
A dominating set in a directed graph is a set of vertices S such that al...
A proof labelling scheme for a graph class 𝒞 is an assignment of
certifi...
We prove that every planar graph is the intersection graph of homothetic...
We present a bijection for toroidal maps that are essentially 3-connecte...
We study the scaling limit of essentially simple triangulations on the t...
We present unified bijections for maps on the torus with control on the
...