Gregarious Path Decomposition of Some Graphs
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Hoffman, Dean G. | |
| dc.contributor.author | Yuceturk, Guven | |
| dc.date.accessioned | 2011-07-21T13:45:50Z | |
| dc.date.available | 2011-07-21T13:45:50Z | |
| dc.date.issued | 2011-07-21 | |
| dc.identifier.uri | http://hdl.handle.net/10415/2687 | |
| dc.description.abstract | Let G be a simple graph and f(v) a positive integer for each vertex v of G. Form G^f by replacing each v by a set F(v) of f(v) vertices, and each edge uv by complete bipartite graph on bipartition (F(u); F(v)). Can we partition G^f into paths of length 2 which are gregarious, that is, meet three di erent F(u)'s? | en_US |
| dc.rights | EMBARGO_NOT_AUBURN | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | Gregarious Path Decomposition of Some Graphs | en_US |
| dc.type | dissertation | en_US |
| dc.embargo.length | NO_RESTRICTION | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |