TY - JOUR

T1 - Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests

AU - Tankus, David

AU - Tarsi, Michael

PY - 2007/7/6

Y1 - 2007/7/6

N2 - 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.

AB - 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.

KW - Greedy algorithm

KW - Hamiltonian graphs

UR - http://www.scopus.com/inward/record.url?scp=34247175423&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2006.09.031

DO - 10.1016/j.disc.2006.09.031

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:34247175423

SN - 0012-365X

VL - 307

SP - 1833

EP - 1843

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 15

ER -