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 条
  • [1] A THEOREM ON PATHS IN PLANAR GRAPHS
    CHIBA, N
    NISHIZEKI, T
    JOURNAL OF GRAPH THEORY, 1986, 10 (04) : 449 - 450
  • [2] PACKING PATHS IN PLANAR GRAPHS
    FRANK, A
    COMBINATORICA, 1990, 10 (04) : 325 - 331
  • [3] A THEOREM ON PATHS IN PLANAR GRAPHS
    THOMASSEN, C
    JOURNAL OF GRAPH THEORY, 1983, 7 (02) : 169 - 176
  • [4] Parametric Shortest Paths in Planar Graphs
    Gajjar, Kshitij
    Radhakrishnan, Jaikumar
    2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), 2019, : 876 - 895
  • [5] A NOTE ON PACKING PATHS IN PLANAR GRAPHS
    FRANK, A
    SZIGETI, Z
    MATHEMATICAL PROGRAMMING, 1995, 70 (02) : 201 - 209
  • [6] Rainbow numbers for paths in planar graphs
    Qin, Zhongmei
    Li, Shasha
    Lan, Yongxin
    Yue, Jun
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 397
  • [7] On Shortest Disjoint Paths in Planar Graphs
    Kobayashi, Yusuke
    Sommer, Christian
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 293 - +
  • [8] Spanning paths in infinite planar graphs
    Dean, N
    Thomas, R
    Yu, XX
    JOURNAL OF GRAPH THEORY, 1996, 23 (02) : 163 - 174
  • [9] Rerouting shortest paths in planar graphs
    Bonsma, Paul
    DISCRETE APPLIED MATHEMATICS, 2017, 231 : 95 - 112
  • [10] A note on packing paths in planar graphs
    Frank, A.
    Szigeti, Z.
    Mathematical Programming, Series B, 1995, 70 (03): : 201 - 209
12345