HAMILTONIAN PATH GRAPHS

被引：6
|
作者：
CHARTRAND, G [1 ]
KAPOOR, SF [1 ]
NORDHAUS, EA [1 ]
机构：
[1] MICHIGAN STATE UNIV, E LANSING, MI 48824 USA
来源：
JOURNAL OF GRAPH THEORY | 1983年 / 7卷 / 04期
关键词：
D O I：
10.1002/jgt.3190070406
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：419 / 427
页数：9
相关论文
共 50 条
  • [1] TREES AND UNICYCLIC GRAPHS WITH HAMILTONIAN PATH GRAPHS
    YU, XX
    JOURNAL OF GRAPH THEORY, 1990, 14 (06) : 705 - 708
  • [2] ON A CONJECTURE ABOUT HAMILTONIAN PATH GRAPHS
    吕涛军
    Science Bulletin, 1988, (02) : 168 - 169
  • [3] ON A CONJECTURE ABOUT HAMILTONIAN PATH GRAPHS
    LU, TJ
    KEXUE TONGBAO, 1988, 33 (02): : 168 - 169
  • [4] ON MINIMUM DEGREE IN HAMILTONIAN PATH GRAPHS
    HENDRY, GRT
    JOURNAL OF GRAPH THEORY, 1988, 12 (04) : 491 - 498
  • [5] HAMILTONIAN CIRCUITS AND PATH COVERINGS OF VERTICES IN GRAPHS
    SKUPIEN, Z
    COLLOQUIUM MATHEMATICUM, 1974, 30 (02) : 295 - 316
  • [6] Hamiltonian path saturated graphs with small size
    Dudek, A
    Katona, GY
    Wojda, AP
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (09) : 1372 - 1379
  • [7] Algorithms for the optimal hamiltonian path in halin graphs
    Li, Yueping
    Lou, Dingjun
    Lu, Yunting
    ARS COMBINATORIA, 2008, 87 : 235 - 255
  • [8] ON AN ANALOG OF TURAN THEOREM FOR HAMILTONIAN PATH GRAPHS
    HENDRY, G
    UTILITAS MATHEMATICA, 1989, 36 : 33 - 44
  • [9] Hamiltonian Walks and Hamiltonian-Connected 3-Path Graphs
    Byers, Alexis
    Hallas, Jamie
    Olejniczak, Drake
    Zayed, Mohra
    Zhang, Ping
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2020, 113 : 213 - 231
  • [10] An approximation algorithm for finding a long path in Hamiltonian graphs
    Vishwanathan, S
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 680 - 685
12345