The Edge-Required-Hamiltonicity of the Cubic 3-Connected Hamiltonian Graphs
碩士 === 國立交通大學 === 資訊科學與工程研究所 === 94 === Given a graph G = (V,E) and edge set R belong E, where the edges of R form independent paths. A graph G is k-edge-required-hamiltonian if it contains a hamiltonian cycle including any R whenever |R| <= k. We define edge-required hamiltonicity of G, denoted...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/85182374904835909497 |