References 3

P. Erdős and T. Gallai, On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hung. 10 (1959) 337-356.
A. McLennan, The Erdős-S&#oacute;s Conjecture for trees of diameter four. J. Graph Theory 49 (2005) 291-301.
J.-F. Sacl&#eacute; and M. Wo&#zacute;niak, The Erdős-S&#oacute;s conjecture for graphs without C₄. J. Combin. Theory Ser. B 70 (1997) 367-372.
D.R. Fulkerson, Blocking and anti-blocking pairs of polyhedra. Math. Programming 1 (1971) 168-194.
M.L. Wachs, Topology of matching, chessboard and general bounded degree graph complexes. Algebra Universalis 49 (2003) 345-385.

Textbooks

R. Diestel, Graph Theory, 3rd ed. Springer, 2005.
(Diestel's "Graph Theory" book page. The book itself is freely downloadable.)
D.B. West, Introduction to Graph Theory, 2nd ed. Prentice Hall, 2001.
(West's "Introduction to Graph Theory" book page)
J.A. Bondy and U.S.R. Murty, Graph Theory. Springer, 2008.
(Blog of the book)