Applications of graphical condensation for enumerating matchings and tilings, Kuo
Graphical condensation involves superimposing matchings of a graph onto matchings of a smaller
subgraph, and then re-partitioning the united matching (actually a multigraph) into matchings of
two other subgraphs, in one of two possible ways. This technique can be used to enumerate perfect matchings of a wide variety of planar bipartite graphs.
Download Now