ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Mathematicae Graph Theory 20(2) (2000) 173-180 DOI: 10.7151/dmgt.1117
Department of Geometry and Algebra
P.J. Safárik University
Jesenná 5, 041 54 Košice, Slovak Republic
The weight of a path in a graph is defined to be the sum of degrees of its vertices in
entire graph. It is proved that each plane triangulation of minimum degree 5 contains a
path P5 on 5 vertices of weight at most 29, the bound being precise, and each
plane triangulation of minimum degree 4 contains a path P4 on 4 vertices of
weight at most 31.
Keywords: weight of path, plane graph, triangulation.
2000 Mathematics Subject Classification: 05C10, 05C38, 52B10.
Received 14 April 1999
Revised 20 August 2000