Publisher: Springer (book); University of Hamburg author site (preview host).
Cited passages: Diestel, Graph Theory, Chapter 2, Exercise 23; Diestel, Graph Theory, Section 2.1, Theorem 2.1.1 and its lower-bound argument; Diestel, Graph Theory, fourth electronic edition, Section 2.1, definition of vertex cover.
Published in Springer, Graduate Texts in Mathematics 173.
The linked University of Edinburgh mirror is the third electronic edition, 2005. Supporting locators here refer to printed pp. 165–167 of that edition, rather than to differently paginated author-hosted previews or later editions.
Cited passages: Section 1.7, printed page 20 and Figure 1.7.3: contracting an edge to one vertex; Section 1.7, printed pages 18–21: subdivisions and Proposition 1.7.3(i); Section 1.7, printed pages 19–20, Corollary 1.7.2: finite minors by deletions and contractions.
Cited passages: Diestel, Graph Theory, Section 1.1; Diestel, Graph Theory, Section 1.5.
Cited passages: Section 4.4, printed page 111, Theorem 4.4.6, equivalence of planarity and exclusion of K5 and K3,3 minors.
Chapter preview from Graph Theory by Reinhard Diestel.
Published in Graph Theory.
Publisher: Springer (book); University of Hamburg author site (preview host).
Cited passages: Diestel, Graph Theory, Chapter 10, opening paragraph, printed p. 323: Hamilton cycles, Hamilton paths, and the contrast with Euler tours; Diestel, Graph Theory, §10.1, Theorem 10.1.1, printed p. 324; Diestel, Graph Theory, §10.1, printed pp. 323–324: necessary minimum degree two and 2-connectivity.

Ancestors (3)

  1. Mathematics bibliography
  2. Mathematics
  3. Home

Incoming links (17)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version