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.
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: GNU MP 6.3.0 manual, §15.1.2 Karatsuba Multiplication: final paragraphs comparing M(N) and K(N), and effects of base-case speedups on thresholds; GNU MP 6.3.0 manual, §15.1.2 Karatsuba Multiplication: sum-based middle product can exceed k limbs; absolute differences and their signs.

There are unlisted articles, also show them or only show them.