The study of Decomposing a complete multipartite graph into pentagons
碩士 === 淡江大學 === 數學學系 === 90 === A complete k-partite graph is a graph whose vertices can be partitioned into k disjoint nonempty sets, and there are no edges within two vertices which are in the same set, and every edge joins two vertices which are in different partite sets. A complete fo...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/80183608379753430640 |