zbMATH — the first resource for mathematics

Computing light edges in planar graphs. (English) Zbl 0705.05023
Topics in combinatorics and graph theory. Essays in honour of Gerhard Ringel, 137-144 (1990).
[For the entire collection see Zbl 0698.00017.]
In 1955 Kotzig showed that a 3-connected planar graph contains an edge such that the degree sum of its end-vertices is at most 13, the bound being best possible. This result has been developed in various directions, and the author proves another such result.
Reviewer: M.Skoviera

05C10 Planar graphs; geometric and topological aspects of graph theory