Decomposition of complete graph into 4-cycles or Hamilton cycles
碩士 === 淡江大學 === 數學學系碩士班 === 98 === A complete graph with n vertices is a simple graph in which every pair of distinct vertices is connected by a unique edge, denoted by K_n. The cycle is a connected graph with n vertices which all vertices are degree 2 and denoted by C_n. A complete graph K_...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/98508453581512779039 |