The weight of an edge is the degree‐sum of its end‐vertices. An edge
is an
‐edge if
and
. In 1955, Kotzig proved that every 3‐connected plane graph contains an edge of weight at most 13. Later, Borodin proved the existence of such an edge in plane graphs with minimum degree at least three....