More about the weight of edges in planar graph

Rok, strany: 1996, 11 - 14

The weight of an edge in a plane graph is the degree sum of its end vertices. Recent results on the minimum weight of all edges, denoted by $w$, of those incident with a triangle, $w^*$, and those incident with two triangles, $w^*\ast$, in a plane graph are discussed. It is proved that if a normal plane map has $w^*\ast=∞$, then either $w^*≤ 9$ or $w≤ 8$, where both bounds are sharp.

ISO 690:

Borodin, O. 1996. More about the weight of edges in planar graph. In Tatra Mountains Mathematical Publications, vol. 9, no.3, pp. 11-14. 1210-3195.

APA:

Borodin, O. (1996). More about the weight of edges in planar graph. Tatra Mountains Mathematical Publications, 9(3), 11-14. 1210-3195.