zbMATH — the first resource for mathematics

On Hamilton’s ideals. (English) Zbl 0213.50803

MSC:
 05C45 Eulerian and Hamiltonian graphs
Full Text:
References:
 [1] Bondy, J.A, Properties of graphs with constraints on degrees, Studia sci. math. hung., 4, 473-475, (1969) · Zbl 0184.27702 [2] Chartrand, G; Kapoor, S.F; Lick, D.R, n-Hamiltonian graphs, J. combinatorial theory, 9, 308-312, (1970) · Zbl 0204.57005 [3] Dirac, G.A, Some theorems on abstract graphs, (), 68-81 · Zbl 0047.17001 [4] Erdös, P; Gallai, T; Harary, F, Graphs with prescribed degrees of vertices (Hungarian), (), 11, 59-274, (1960), See also [5] Moon, J.W; Moser, L, On Hamiltonian bipartite graphs, Israel J. math., 1, 163-165, (1963) · Zbl 0119.38806 [6] Nash-Williams, C.St.J.A, On Hamiltonian circuits in finite graphs, (), 466-467 · Zbl 0144.45301 [7] {\scC. St. J. A. Nash-Williams}, Hamiltonian Arcs and Circuits, mimeographed lecture text, University of Waterloo. · Zbl 0223.05122 [8] Pósa, L, A theorem concerning Hamiltonian lines, Magyar tud. akad. mat. kutató int. Közl., 7, 225-226, (1962) · Zbl 0114.40003 [9] Tutte, W.T, A short proof of the factor theorem for finite graphs, Canad. J. math., 6, 347-352, (1954) · Zbl 0055.17102
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.