Literatur
- [BLS00]
Andreas Brandst\"adt, V.~Bang Le, , and Jeremy~P. Spinrad.
Graph Classes: A Survey.
Society for Industrial and Applied Mathematics, Philadelphia, 2000.
http://www.informatik.uni-rostock.de/~ab/survey/survey.html.
- [Bol79]
Bel\'a Bollob\'as.
Graph Theory --- An Introductory Course.
Springer, 1979.
- [Bol98]
Bel\'a Bollob\'as.
Modern Graph Theory.
Springer, 1998.
- [Bra94]
Andreas Brandst\"adt.
Graphen und Algorithmen.
Teubner, Stuttgart, 1994.
- [BW02]
Christian Biemann and Johannes Waldmann.
Non-embedding primes and squares.
http://www.informatik.uni-leipzig.de/~joe/projekte/wqo/paper/,
2002.
- [CLR91]
T.~H. Cormen, C.~E. Leiserson, and R.~L. Rivest.
Introduction to Algorithms.
The MIT Press, 1991.
http://theory.lcs.mit.edu/~clr/.
- [Die96]
Reinhard Diestel.
Graphentheorie.
Springer, 1996.
http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/.
- [Hal89]
Rudolf Halin.
Graphentheorie.
Akademie--Verlag Berlin/Wissenschaftliche Buchgesellschaft Darmstadt,
1989.
- [Tho96]
Neil Robertson; Daniel P. Sanders; Paul Seymour;~Robin Thomas.
A new proof of the four-colour theorem, 1996.
http://www.ams.org/journal-getitem?pii=S1079-6762-96-00003-0.
- [Wal00]
Johannes Waldmann.
Kombinatorik auf endlichen strukturen (skript).
http://www.informatik.uni-leipzig.de/~joe/edu/ss00/kombinat/,
2000.
- [Wes01]
Douglas~B. West.
Introduction to Graph Theory.
Prentice Hall, 2001.
http://www.math.uiuc.edu/~west/igt/.