On paths in planar graphs

被引：0
|
作者：
Sanders, DP
机构：
[1] Department of Mathematics, Ohio State University, Columbus
来源：
JOURNAL OF GRAPH THEORY | 1997年 / 24卷 / 04期
关键词：
D O I：
10.1002/(SICI)1097-0118(199704)24:4<341::AID-JGT6>3.0.CO;2-O
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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. (C) 1997 John Wiley & Sons, Inc.
引用
收藏
页码：341 / 345
页数：5
相关论文
共 50 条
12345