A method in graph theory

Berge, 1973

Boesch, 1973, On covering the points of a graph with point disjoint paths

Bondy, 1969, Properties of graphs with constraints on degrees, Studia Sci. Math. Hungar., 4, 473

Chartrand, 1970, N-Hamiltonian graphs, J. Combin. Theory, 9, 308, 10.1016/S0021-9800(70)80069-2

Chvátal, 1972, On Hamilton's ideals, J. Combin. Theory, 12, 163, 10.1016/0095-8956(72)90020-2

E.J. Cockayne and P.J. Lorimer, The Ramsey graph number for stripes, Report Series 37, Dept. Math., Univ. Auckland, Auckland.

Dirac, 1952, Some theorems on abstract graphs, Proc. London Math. Soc., 2, 68

Grünbaum, 1967

Harary, 1969

Hašek, 1951

Kronk, 1969, Variations on a theorem of Pósa, 193

Las Vergnas, 1971, Sur une proprieté des arbres maximaux dans un graphe, C.R. Acad. Sci. Paris, 272, 1297

Las Vergnas, 1972, VI

Ore, 1960, Note on Hamilton circuits, Am. Math. Monthly, 67, 55, 10.2307/2308928

Pósa, 1962, A theorem concerning Hamiltonian lines, Magyar Tud. Akad. Mat. Kutató Inst. Közl., 7, 225

Ramsey, 1930, On a problem of formal logic, Proc. London Math. Soc., 30, 264, 10.1112/plms/s2-30.1.264