Cubic Hamiltonian Graphs of Various Types
碩士 === 國立交通大學 === 應用數學系 === 91 === Let U be the set of connected planar cubic hamiltonian graphs, A be the set of hamiltonian 1-vertex hamiltonian graphs in U, B be the set of 1-edge hamiltonian graphs in U, and C be the set of hamiltonian connected graphs...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/80137444380933832606 |
| Summary: | 碩士 === 國立交通大學 === 應用數學系 === 91 === Let U be the set of connected planar cubic hamiltonian
graphs, A be the set of hamiltonian 1-vertex hamiltonian graphs
in U, B be the set of 1-edge hamiltonian graphs in U, and
C be the set of hamiltonian connected graphs in U. With the
and/or exclusion of the sets A,B, and C, U is divided into
eight subsets. In this paper, we prove that there are infinitely many elements in each of the eight subsets.
|
|---|