×

zbMATH — the first resource for mathematics

Bridges and Hamiltonian circuits in planar graphs. (English) Zbl 0357.05039

MSC:
05C10 Planar graphs; geometric and topological aspects of graph theory
57M15 Relations of low-dimensional topology with graph theory
05C35 Extremal problems in graph theory
05C15 Coloring of graphs and hypergraphs
PDF BibTeX XML Cite
Full Text: DOI EuDML
References:
[1] Grinberg, È. Ja,Plane homogeneous graphs of degree three without Hamiltonian circuits. (Russian. Latvian and English summaries). Latvian Math. Yearbook4 (1968), 51–58.
[2] Newman, M. H. A.,Elements of the topology of plane sets of points, 2nd edition. Cambridge University Press, 1951. · Zbl 0045.44003
[3] Ore, O.,The four-color problem. Academic Press, New York, 1967. · Zbl 0149.21101
[4] Sachs, H.,Einführung in die Theorie der endlichen Graphen, Teil II. B. G. Teubner, Leipzig, 1972. · Zbl 0239.05105
[5] Tutte, W. T.,A theorem on planar graphs. Trans. Amer. Math. Soc.82 (1956), 99–116. · Zbl 0070.18403 · doi:10.1090/S0002-9947-1956-0081471-8
[6] Tutte, W. T.,Connectivity in graphs. University of Toronto Press, Toronto, 1966. · Zbl 0146.45603
[7] Tutte, W. T.,Introduction to the theory of matroids. American Elsevier, New York, 1971. · Zbl 0231.05027
[8] Whitney, H.,A theorem on graphs. Ann. of Math.32 (1931), 378–390. · JFM 57.0727.03 · doi:10.2307/1968197
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.