Perfect matchings after vertex deletions in n-dimensional lattice graphs

This thesis studies lattice graphs which are readily seen to have many perfect matchings and considers whether if we delete vertices the resulting graphs continue to have perfect matchings. It is clear that one can destroy the property of having a perfect matching by deleting an odd number of ver...

Full description

Bibliographic Details
Main Author: Yang, Hangjun
Language:English
Published: 2009
Online Access:http://hdl.handle.net/2429/16911

Similar Items