On the existence of vertex transitive 4-ordered hamiltonian and 4-ordered hamiltonian connected cubic graphs
碩士 === 靜宜大學 === 資訊工程學系 === 102 === A graph is k-ordered hamiltonian if for every ordered set S of k vertices there exists a hamiltonian cycle which encounters S in its designated order. A graph is k-ordered hamiltonian connected if for every k ordered set S = {x_1, x_2, . . . , x_k} there exists a h...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/84480678632125749547 |