Name
Abstract | ||
|---|---|---|
Given positive integers k ≤ m ≤ n, a graph G of order n is (k, m)-pancyclic ordered if for any set of k vertices of G and any integer r with m ≤ r ≤ n, there is a cycle of length r encountering the k vertices in a specified order. Minimum degree conditions that imply a graph of sufficiently large order n is (k, m)-pancylic ordered are proved. Examples showing that these constraints are best possible are also provided. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s00373-005-0604-5 | Graphs and Combinatorics |
Keywords | Field | DocType |
Positive Integer, Minimal Degree, Large Order, Degree Condition, Ordered Graph | Integer,Topology,Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Bound graph,Ordered graph,Comparability,Mathematics | Journal |
Volume | Issue | ISSN |
21 | 2 | 1435-5914 |
Citations | PageRank | References |
1 | 0.34 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ralph J. Faudree | 1 | 559 | 92.90 |
| Ronald J. Gould | 2 | 641 | 94.81 |
| Michael S. Jacobson | 3 | 1 | 0.34 |
| Linda M. Lesniak | 4 | 15 | 3.13 |