# Portal:Graph theory

*Part of the Division of Computer Science and the Division of Pure Mathematics*

Since there is already a separate division for combinatorics, the pre-requisite combinatorics necessary to study this subject can be introduced as necessary or shared with that division. Graph theory is one of the largest areas of modern mathematics, and also has interesting applications in the physical, life, and computing sciences. The area is so broad that learning materials may vary from the level of a high-school student (the introduction below) to that of a mathematics graduate.

## Department news[edit | edit source]

**Wednesday, August 23, 2006**- Department founded!

## Learning materials and learning projects[edit | edit source]

Wikiversity has adopted the "learning by doing" model for education. Lessons should center on learning activities for Wikiversity participants. Learning materials and learning projects can be used by multiple departments. Cooperate with other departments that use the same learning resource.

Learning materials and learning projects are located in the main Wikiversity namespace. Simply make a link to the name of the lesson (lessons are independent pages in the main namespace) and start writing!

## Offsite courses[edit | edit source]

### With video lectures[edit | edit source]

*Graph Theory*(notes), L. Sunil Chandran, Indian Institute of Science, Bangalore*Mathematics for Computer Science*(lectures 6 to 10), Tom Leighton and Marten van Dijk, Massachusetts Institute of Technology, Fall 2010.*Math107 Graph Theory*, Open Course Library

### Without video lectures[edit | edit source]

*Graph and Network Theory*, Ilesanmi Adeboye, University of California Santa Barbara, Winter 2011.*Graph Theory I (Math 345)*, Luis Goddyn, Simon Fraser University, Fall 2011.*Graph Theory II (Math 445)*, Luis Goddyn, Simon Fraser University, Fall 2013. (Earlier versions: Fall 2006)*Graph Theory (Math 820)*, Luis Goddyn, Simon Fraser University, Spring 2010. (Earlier versions: Spring 2004)*Introduction to Graph Theory*, Douglas West and Stephen Hartke, University of Illinois, Spring 2005*Graph Theory*, S.A. Choudum, IIT Madras.*Graph Theory*, Oliver Riordan, University of Oxford, Spring 2014*Introduction to Graph Theory*, Mike Zabrocki, York University, Spring 2003*Graph Theory*, Mia Minnes, UC San Diego, Fall 2012.*Combinatorics and Graph Theory*, David E Speyer, University of Michigan, Fall 2013*Graph Theory*, John Mackey, Carnegie Mellon University, Spring 2013*Graph Theory & Combinatorics*, D. L. White, Kent State University, Fall 2009*Graph Theory*, Taje Ramsamujh, Florida International University, Spring 2015.*Graph Theory*, Jim Nastos, University of Alberta, Summer 2008.*Graph Theory*, Terry Loring, University of New Mexico, Spring 2009. (Earlier versions: Spring 2007, Spring 2005, Spring 2002)

#### Discrete math courses containing graph theory[edit | edit source]

*Discrete Math*, Michael Damron, New York University, Fall 2008. (Earlier versions: Spring 2007)*Introduction to Contemporary Mathematics*, Larry Bowen, University of Alabama.*Discrete Structures*, Margaret Fleck and Eric Shaffer, Spring 2009

## Offsite Learning Materials[edit | edit source]

- Graph Theory Tutorials
- Douglas B. West's Home Page
- Links to open problems - West, Goddyn
- Category:Graph theory on Wikipedia
- BarcelonaTech: Graph Theory Exercises and Problems
- Twenty Proofs of Euler's Formula: V-E+F=2

## Recommended Reading Material[edit | edit source]

If you want to learn graph theory, you will need to read and complete the exercises in at least one of the following books. While this site provides a supportive community of peers and teachers, nothing beats having a well-organized and well-written text that you can study anywhere to learn. Mathematics is not a spectator-sport. You must **do** mathematics to learn it.

- Bollobas, Bela. (2002).
*Modern Graph Theory*Springer. ISBN 0387984887

te who the active participants are. If you are an active participant in this department, you can list your name here (this can help small departments grow and the participants communicate better; for large departments a list of active participants is not needed).

- ...