Summary

Page last modified 18:29, 17 Dec 2008 by GJRoelofs | Page History
Table of contents

To help out on this summary, just press edit, fill in your name next to the chapter you want to do and press save.
Then you can press the chapter title to start working.

Summary Files

Required for Exam

C1.1-1.4     C2.1-2.4     C4.1-4.3     C6.1-6.2     C8.1     C9.1 + 9.3     C10.2   Hungarian Method

Title
Name
Status
Introduction  Ruud Wetzels & Gijs-Jan Roelofs Done
Degrees  Ruud Wetzels Done
Isomorphic Graphs     
Trees  Ruud Wetzels Done
Connectivity     
Traversability  Ruud Wetzels Done
Digraphs     
Matchings and Factorization  Ruud Wetzels Done
Planarity  Ruud Wetzels Done
Coloring  Ruud Wetzels Done
Ramsey Numbers     
Distance     
Domination     
Hungarian Method Ruud Wetzels Done

 

 

Tag page
Page statistics
838 view(s), 15 edit(s), and 4201 character(s)

Comments

You must login to post a comment.

Attach file

Attachments

FileSizeDateAttached by 
 Graph theory.doc
Summary Doc by Ruud Wetzels
157.5 kB17:02, 17 Dec 2008GJRoelofsActions
 graph_theory_summary.pdf
Summary by Fabian Wahle
74.63 kB18:28, 17 Dec 2008GJRoelofsActions
 graph_theory_theorems.pdf
Theorems by Andreas ten Pas
70.29 kB18:28, 17 Dec 2008GJRoelofsActions