id: 01965377
dt: j
an: 01965377
au: Fournier, J. C.
ti: Combinatorics of perfect matchings in plane bipartite graphs and
    application to tilings.
so: Theor. Comput. Sci. 303, No. 2-3, 333-351 (2003).
py: 2003
pu: Elsevier Science Publishers, Amsterdam
la: EN
cc: 
ut: 
ci: Zbl 0830.05020
li: doi:10.1016/S0304-3975(02)00496-6
ab: Summary: Let $G$ be a plane bipartite graph which admits a perfect matching
    and with distinguished faces called holes. Let $\cal M_G$ denote the
    perfect matchings graph: its vertices are the perfect matchings of $G$,
    two of them being joined by an edge, if and only if they differ only on
    an alternating cycle bounding a face which is not a hole. We solve the
    following problem: Find a criterion for two perfect matchings of G to
    belong to the same connected component of $\cal M_{\cal G}$, and in
    particular determine in which case $\cal M_{\cal G}$ is connected. The
    motivation of this work is a result on tilings of {\it N. C. Saldanha,
    C. Tomei, M. A. Casarin jun.} and {\it D. Romualdo} [Discrete Comput.
    Geom. 14, 207‒233 (1995; Zbl 0830.05020)].
rv: