Name
Abstract | ||
|---|---|---|
For a positive integer k , a graph G is k-ordered if for every ordered sequence of k vertices, there is a cycle that encounters the vertices in the sequence in the given order. If the cycle is also a hamiltonian cycle, then G is said to be k-ordered hamiltonian . Forbidden connected subgraphs and forbidden pairs of connected subgraphs that imply that a 2-connected graph is hamiltonian have been characterized. Each of these forbidden subgraph conditions will be investigated to determine if it implies more than just hamiltonicity, but in fact it implies k -ordered or k -ordered hamiltonian in the presence of the appropriate connectivity on the graph. More general classes of forbidden subgraphs that imply k -ordered and k -ordered hamiltonian will also be considered. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(00)00458-1 | Discrete Mathematics |
Keywords | Field | DocType |
k-ordered hamiltonian,hamiltonian cycle,connected graph | Graph theory,Integer,Discrete mathematics,Combinatorics,Hamiltonian (quantum mechanics),Forbidden graph characterization,Vertex (geometry),Hamiltonian path,Connectivity,Partially ordered set,Mathematics | Journal |
Volume | Issue | ISSN |
243 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
7 | 0.66 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. J. Faudree | 1 | 174 | 38.15 |
| R. J. Faudree | 2 | 174 | 38.15 |