A two-connected planar graph without concurrent longest paths. (English) Zbl 0243.05110


05C10 Planar graphs; geometric and topological aspects of graph theory
05C35 Extremal problems in graph theory
Full Text: DOI


[1] Theory of graphs, ()
[2] Tutte, W.T, On Hamiltonian circuits, J. London math. soc., 21, 98-101, (1946) · Zbl 0061.41306
[3] Walther, H, Über die nichtexistenz eines knotenpunktes, durch den alle längsten wege eines graphen gehen, J. combinatorial theory, 6, 1-6, (1969) · Zbl 0184.27504
[4] Walther, H, Über die nichtexistenz zweier knotenpunkte eines graphen, die alle längsten kreise fassen, J. combinatorial theory, 8, 330-333, (1970) · Zbl 0191.55203
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.