Show simple item record

dc.contributor.advisorHoffman, Dean G.
dc.contributor.authorYuceturk, Guven
dc.date.accessioned2011-07-21T13:45:50Z
dc.date.available2011-07-21T13:45:50Z
dc.date.issued2011-07-21
dc.identifier.urihttp://hdl.handle.net/10415/2687
dc.description.abstractLet 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.rightsEMBARGO_NOT_AUBURNen_US
dc.subjectMathematics and Statisticsen_US
dc.titleGregarious Path Decomposition of Some Graphsen_US
dc.typedissertationen_US
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US


Files in this item

Show simple item record