| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650905 | Discrete Mathematics | 2007 | 11 Pages |
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
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
David Tankus, Michael Tarsi,