Premium
A theorem on paths in planar graphs
Author(s) -
Thomassen Carsten
Publication year - 1983
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/jgt.3190070205
Subject(s) - planar graph , mathematics , combinatorics , polyhedral graph , planar straight line graph , graph minor , planar , outerplanar graph , discrete mathematics , conjecture , robertson–seymour theorem , book embedding , 1 planar graph , graph , pathwidth , chordal graph , line graph , graph power , computer science , computer graphics (images)
Abstract We prove a theorem on paths with prescribed ends in a planar graph which extends Tutte's theorem on cycles in planar graphs [9] and implies the conjecture of Plummer [5] asserting that every 4‐connected planar graph is Hamiltonian‐connected.