1. Kenneth H. Rosen. Discrete mathematics and its applications. McGraw-Hill, Boston, 5th edition, 2003.
   Note: 2002070890 Kenneth H. Rosen. Includes bibliographic references (p. 1-8, 4th set) and indexes.
   Keywords: theory of computation, computational complexity, honours reading. [bibtex-entry]



2. John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, Boston, 2nd edition, 2001.
   Note: 00064608 John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman. Includes bibliographical references (p. 510-511) and index.
   Keywords: theory of computation, computational complexity, honours reading. [bibtex-entry]



3. Alan Gibbons. Algorithmic graph theory. Cambridge University Press, Cambridge ; New York, 1985.
   Note: Alan Gibbons. Includes bibliographies and indexes.
   Keywords: graph theory, theory of computation, computational complexity, honours reading. [bibtex-entry]



4. John E. Hopcroft and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, Mass., 1979.
   Note: John E. Hopcroft, Jeffrey D. Ullman. ill. ; 24 cm. Includes index.
   Keywords: theory of computation, computational complexity, 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.