Decomposing Graphs With Two Associate Classes Into Paths Of Length 3 And The Intersection Problem Of Latin Rectangles
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Rodger, Chris | |
| dc.contributor.author | Yeh, Bin | |
| dc.date.accessioned | 2018-07-24T16:19:05Z | |
| dc.date.available | 2018-07-24T16:19:05Z | |
| dc.date.issued | 2018-07-24 | |
| dc.identifier.uri | http://hdl.handle.net/10415/6351 | |
| dc.description.abstract | In this thesis, the decomposition problem of graphs with two associate classes into paths of length 3 is completely settled. The intersection problem for latin rectangles is completely solved as well. In addition, an Euler circuit of K(n, p) with diameter at least (n−3)p/2+1 is constructed and the intersection problem of latin squares of order n and n+1 is discussed. | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | Decomposing Graphs With Two Associate Classes Into Paths Of Length 3 And The Intersection Problem Of Latin Rectangles | en_US |
| dc.type | PhD Dissertation | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |
| dc.contributor.committee | Hoffman, Dean | |
| dc.contributor.committee | Johnson, Peter | |
| dc.contributor.committee | Jessica, McDonald | |
| dc.creator.orcid | 0000-0001-7680-9349 | en_US |