1. M. T. Hajiaghayi, E. D. Demaine, N. Nishimura, P. Ragde, and D. Thilikos. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. Journal of Computer and System Sciences, 69(2):166--195, 2004.
   Keywords: graph matching, honours reading, graph theory. [bibtex-entry]



2. A. Dovier and C. Piazza. The Subgraph Bisimulation Problem. IEEE Transactions on Knowledge & Data Engineering, 15(4):1055--6, 2003.
   Note: Publisher: IEEE, USA.
   Keywords: graph theory, model theory, honours reading, graph matching. [abstract] [bibtex-entry]



3. R. J. van Glabbeek and W. Peter Weijland. Branching time and abstraction in bisimulation semantics. J. ACM, 43(3):555--600, 1996.
   Keywords: model theory, honours reading, graph theory, graph matching. [bibtex-entry]



4. David Eppstein. Connectivity, graph minors, and subgraph multiplicity. Journal of Graph Theory, 17:409--416, 1993.
   Keywords: graph theory, graph matching, honours reading. [bibtex-entry]



5. A. V. Goldberg and R. E. Tarjan. A New Approach to the Maximum-Flow Problem. Journal of the Association for Computing Machinery, 35(4):921--40, 1988.
   Keywords: graph matching, honours reading. [bibtex-entry]



6. H. N. Gabow. An Efficient Implementation of Edmonds’ Algorithm for Maximum Matching on Graphs. Journal of the ACM, 23:221--234, 1976.
   Keywords: graph matching, honours reading. [bibtex-entry]

1. MohammadTaghi Hajiaghayi and Naomi Nishimura. Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. In Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, Warsaw, Poland, August , appears in Lecture Notes in Computer Science, Vol 2420, volume 2420, pages 305--318, 2002.
   Keywords: graph matching, honours reading, graph theory. [abstract] [bibtex-entry]



2. H. Bunke. Recent developments in graph matching. In 15th International Conference on Pattern Recognition, volume 2, pages 117--124, 2000.
   Keywords: graph matching, honours reading. [bibtex-entry]

1. Mohammad Taghi Hajiaghayi. Algorithms for Graphs of (Locally) Bounded Treewidth. PhD thesis, University of Waterloo, 2001.
   Keywords: graph matching, graph theory, algorithms, honours reading. [bibtex-entry]

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.