Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests

被引：4
|
作者：
Tankus, David
Tarsi, Michael
机构：
[1] Sami Shamroon Coll Engn, Software Engn Dept, IL-84100 Beer Sheva, Israel
[2] Tel Aviv Univ, Sch Comp Sci, IL-69978 Ramat Aviv, Israel
来源：
DISCRETE MATHEMATICS | 2007年 / 307卷 / 15期
关键词：
Hamiltonian graphs; Greedy algorithm;
D O I：
10.1016/j.disc.2006.09.031
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
There are various greedy schemas to construct a maximal path in a given input graph. Associated with each such schema is the family of graphs where it always results a path of maximum length, or a Hamiltonian path/cycle, if there exists one. Considerable amount of work has been carried out, regarding the characterization and recognition problems of such graphs. We present here a systematic listing of previous results of this type and fill up most of the remaining empty entries. (c) 2006 Published by Elsevier B.V.
引用
收藏
页码：1833 / 1843
页数：11
相关论文
共 50 条
  • [1] On Hamiltonian cycles and Hamiltonian paths
    Rahman, MS
    Kaykobad, M
    [J]. INFORMATION PROCESSING LETTERS, 2005, 94 (01) : 37 - 41
  • [2] Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
    Xue, Shudan
    Deng, Qingying
    Li, Pingshan
    Chen, Jianguo
    [J]. DISCRETE APPLIED MATHEMATICS, 2023, 334 : 68 - 80
  • [3] On Hamiltonian alternating cycles and paths
    Claverol, Merce
    Garcia, Alfredo
    Garijo, Delia
    Seara, Carlos
    Tejel, Javier
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2018, 68 : 146 - 166
  • [4] Hamiltonian paths and cycles in hypertournaments
    Gutin, G
    Yeo, A
    [J]. JOURNAL OF GRAPH THEORY, 1997, 25 (04) : 277 - 286
  • [5] Hamiltonian cycles and Hamiltonian paths in faulty burnt pancake graphs
    Kaneko, Keiichi
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2007, E90D (04): : 716 - 721
  • [6] Embedding Hamiltonian paths and Hamiltonian cycles in faulty pancake graphs
    Hung, CN
    Liang, KY
    Hsu, LH
    [J]. I-SPAN'02: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2002, : 179 - 184
  • [7] Hamiltonian paths and cycles in Fibonacci cubes
    Zelina, Ioana
    [J]. CARPATHIAN JOURNAL OF MATHEMATICS, 2008, 24 (01) : 149 - 155
  • [8] ENUMERATION OF HAMILTONIAN CYCLES AND PATHS IN A GRAPH
    LIU, CJ
    [J]. PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1991, 111 (01) : 289 - 296
  • [9] On the maximum number of Hamiltonian paths in tournaments
    Adler, I
    Alon, N
    Ross, SM
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (03) : 291 - 296
  • [10] THE MAXIMUM NUMBER OF HAMILTONIAN PATHS IN TOURNAMENTS
    ALON, N
    [J]. COMBINATORICA, 1990, 10 (04) : 319 - 324
12345