I have successfully defended my master’s thesis on graph-transverse matching problems! The thesis considers the problem of deciding whether a given graph G admits a matching which covers every copy of a fixed tree or cycle. It contains a number of results, including a refinement of my paper on cycle-transverse matchings and new algorithms and NP-completeness results for tree-transverse matching problems.
Slides of my defence can be found here. I am grateful to NSERC for funding my degree with a Alexander Graham Bell Canada Graduate Scholarship, and to my supervisor Jing Huang.
On graph-transverse matching problems. Ross Churchley (2012). ↩︎