Jonathan Blackman
University of British Columbia
Scientific, Seminar
Perfect matchings in grid graphs after vertex deletions
We investigate the d-dimensional grid graph [m]x[m]x...x[m] for even m. The graph is bipartite. If we choose a subset B' of the black vertices and a subset W' of the white vertices then the graph obtained by deleting B' and W' has a perfect matching...