Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests

David Tankus; Michael Tarsi

doi:10.1016/j.disc.2006.09.031

Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests

David Tankus^*
, Michael Tarsi

^*Corresponding author for this work

School of Computer Science and AI

Sami Shamoon College of Engineering

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	1833-1843
Number of pages	11
Journal	Discrete Mathematics
Volume	307
Issue number	15
DOIs	https://doi.org/10.1016/j.disc.2006.09.031
State	Published - 6 Jul 2007

Keywords

Greedy algorithm
Hamiltonian graphs

Access to Document

10.1016/j.disc.2006.09.031

Cite this

@article{510540fa2c8741c6af0d707833dbd29d,

title = "Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests",

abstract = "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.",

keywords = "Greedy algorithm, Hamiltonian graphs",

author = "David Tankus and Michael Tarsi",

year = "2007",

month = jul,

day = "6",

doi = "10.1016/j.disc.2006.09.031",

language = "אנגלית",

volume = "307",

pages = "1833--1843",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "15",

}

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 - https://www.scopus.com/pages/publications/34247175423

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 -

Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this