Decomposition of Complete Tri-Partite Graphs into 5-Cycles
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Rodger, Chris | |
| dc.contributor.author | Davis, Christopher | |
| dc.date.accessioned | 2013-04-16T19:54:33Z | |
| dc.date.available | 2013-04-16T19:54:33Z | |
| dc.date.issued | 2013-04-16 | |
| dc.identifier.uri | http://hdl.handle.net/10415/3535 | |
| dc.description.abstract | E. S. Mahmoodian gave necessary conditions for when the edges of a complete tripartite graph can be partitioned so that each set in the partition induces a 5-cycle. Since then, he, N. J. Cavenagh, E. J. Billington, S. Alipour, and E. Mollaahmadi have found several cases where these necessary conditions are also sufficient. We continue this investigation by considering further cases for complete tripartite graphs. | en_US |
| dc.rights | EMBARGO_NOT_AUBURN | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | Decomposition of Complete Tri-Partite Graphs into 5-Cycles | en_US |
| dc.type | thesis | en_US |
| dc.embargo.length | NO_RESTRICTION | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |