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 条
  • [41] Counting paths, cycles, and blow-ups in planar graphs
    Cox, Christopher
    Martin, Ryan R.
    JOURNAL OF GRAPH THEORY, 2022, 101 (03) : 521 - 558
  • [42] Fully dynamic approximation scheme for shortest paths in planar graphs
    Algorithmica (New York), 1998, 22 (03): : 235 - 249
  • [43] A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
    P. N. Klein
    S. Subramanian
    Algorithmica, 1998, 22 : 235 - 249
  • [44] Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2
    Seguin-Charbonneau, Loic
    Shepherd, F. Bruce
    2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 200 - 209
  • [45] A linear time algorithm for the induced disjoint paths problem in planar graphs
    Kawarabayashi, Ken-ichi
    Kobayashi, Yusuke
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2012, 78 (02) : 670 - 680
  • [46] Light paths and edges in families of outer-1-planar graphs
    Zhang, Xin
    Lan, Jingfen
    Li, Bi
    Zhu, Qiang
    INFORMATION PROCESSING LETTERS, 2018, 136 : 83 - 89
  • [47] Maximum edge-disjoint paths in planar graphs with congestion 2
    Seguin-Charbonneau, Loic
    Shepherd, F. Bruce
    MATHEMATICAL PROGRAMMING, 2021, 188 (01) : 295 - 317
  • [48] Bounding the number of odd paths in planar graphs via convex optimization
    Antonir, Asaf Cohen
    Shapira, Asaf
    JOURNAL OF GRAPH THEORY, 2024, 107 (02) : 330 - 343
  • [49] Maximum edge-disjoint paths in planar graphs with congestion 2
    Loïc Séguin-Charbonneau
    F. Bruce Shepherd
    Mathematical Programming, 2021, 188 : 295 - 317
  • [50] Long paths and toughness of k-trees and chordal planar graphs
    Kabela, Adam
    DISCRETE MATHEMATICS, 2019, 342 (01) : 55 - 63
12345