Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem


A bipartite graph is said to be symmetric if it has symmetry of reflecting two vertex sets. This paper investigates matching structure of symmetric bipartite graphs. We first apply the Dulmage-Mendelsohn decomposition to a symmetric bipartite graph. The resulting components, which are matching-covered, turn out to have symmetry. We then decompose a matching… (More)
DOI: 10.1016/j.jctb.2010.06.003


6 Figures and Tables

Slides referencing similar topics