Premium
On paths in planar graphs
Author(s) -
Sanders Daniel P.
Publication year - 1997
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199704)24:4<341::aid-jgt6>3.0.co;2-o
Subject(s) - corollary , mathematics , planar graph , combinatorics , planar , planar straight line graph , outerplanar graph , path (computing) , enhanced data rates for gsm evolution , graph , discrete mathematics , book embedding , 1 planar graph , chordal graph , pathwidth , line graph , computer science , telecommunications , computer graphics (images) , programming language
This paper generalizes a theorem of Thomassen on paths in planar graphs. As a corollary, it is shown that every 4‐connected planar graph has a Hamilton path between any two specified vertices x, y and containing any specified edge other than xy . © 1997 John Wiley & Sons, Inc.