A LINEAR ALGORITHM FOR FINDING HAMILTONIAN CYCLES IN 4-CONNECTED MAXIMAL PLANAR GRAPHS

被引：13
|
作者：
ASANO, T
KIKUCHI, S
SAITO, N
机构：
[1] TOSHIBA CORP,CTR RES & DEV,KAWASAKI 210,JAPAN
[2] TOHOKU UNIV,FAC ENGN,DEPT ELECT COMMUN,SENDAI,MIYAGI 980,JAPAN
来源：
DISCRETE APPLIED MATHEMATICS | 1984年 / 7卷 / 01期
关键词：
D O I：
10.1016/0166-218X(84)90109-4
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：1 / 15
页数：15
相关论文
共 50 条
  • [1] Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs
    Goering, F.
    Harant, J.
    [J]. DISCRETE MATHEMATICS, 2010, 310 (09) : 1491 - 1494
  • [2] Cycles in 4-connected planar graphs
    Chen, GT
    Fan, GH
    Yu, XX
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2004, 25 (06) : 763 - 780
  • [3] Long cycles in 4-connected planar graphs
    Cui, Qing
    Hu, Yumei
    Wang, Jian
    [J]. DISCRETE MATHEMATICS, 2009, 309 (05) : 1051 - 1059
  • [4] 4-CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN
    THOMAS, R
    YU, XX
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 62 (01) : 114 - 132
  • [5] CONTRACTILE EDGES IN 4-CONNECTED MAXIMAL PLANAR GRAPHS
    MCCUAIG, WD
    HAGLIN, DJ
    VENKATESAN, SM
    [J]. ARS COMBINATORIA, 1991, 31 : 199 - 203
  • [6] 4-connected maximal planar graphs are 4-ordered
    Goddard, W
    [J]. DISCRETE MATHEMATICS, 2002, 257 (2-3) : 405 - 410
  • [7] ON LONGEST CYCLES IN ESSENTIALLY 4-CONNECTED PLANAR GRAPHS
    Fabrici, Igor
    Harant, Jochen
    Jendrol', Stanislav
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2016, 36 (03) : 565 - 575
  • [8] LONGER CYCLES IN ESSENTIALLY 4-CONNECTED PLANAR GRAPHS
    Fabrici, Igor
    Harant, Jochen
    Mohr, Samuel
    Schmidt, Jens M.
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2020, 40 (01) : 269 - 277
  • [9] Longer cycles in essentially 4-connected planar graphs
    Fabrici, Igor
    Harant, Jochen
    Mohr, Samuel
    Schmidt, Jens M.
    [J]. arXiv, 2017,
  • [10] 4-connected projective-planar graphs are hamiltonian-connected
    Kawarabayashi, Ken-ichi
    Ozeki, Kenta
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 378 - 395
12345