52 citations · 402 across the 46 of their papers we have counts for
5 papers · 1 filter
Laplacian matrices and spanning trees of tree graphs
Philippe Biane, Guillaume Chapuy
If is a strongly connected finite directed graph, the set of rooted directed spanning trees of is naturally equipped with a structure of directed graph: ther…
Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
Guillaume Chapuy, Guillem Perarnau
A class of graphs is bridge-addable if given a graph in the class, any graph obtained by adding an edge between two connected components of is also in the class. We prove a…
Dimers on Rail Yard Graphs
Cédric Boutillier, Jérémie Bouttier, Guillaume Chapuy +2
We introduce a general model of dimer coverings of certain plane bipartite graphs, which we call rail yard graphs (RYG). The transfer matrices used to compute the partition functio…
Generating functions of bipartite maps on orientable surfaces
Guillaume Chapuy, Wenjie Fang
We compute, for each genus , the generating function of (labelled) bipartite maps on the orientable surface of genus , with control on…
A bijection for rooted maps on general surfaces
Guillaume Chapuy, Maciej Dołęga
We extend the Marcus-Schaeffer bijection between orientable rooted bipartite quadrangulations (equivalently: rooted maps) and orientable labeled one-face maps to the case of all su…