Show simple item record

dc.contributor.supervisor Gunderson, David (Mathematics) en_US
dc.contributor.author Arman, Andrii
dc.date.accessioned 2018-05-31T19:36:39Z
dc.date.available 2018-05-31T19:36:39Z
dc.date.issued 2016 en_US
dc.date.submitted 2018-05-08T22:05:40Z en
dc.date.submitted 2018-05-24T16:38:45Z en
dc.identifier.citation A. Arman, D. Gunderson, and S. Tsaturian, Triangle-free graphs with the maximum number of cycles, Discrete Math. 339 (2016), 699--711 en_US
dc.identifier.uri http://hdl.handle.net/1993/33030
dc.description.abstract In this thesis a problem of determining the maximum number of cycles for the following classes of graphs is considered: triangle-free graphs; K_r-free graphs; graphs with m edges; graphs with n vertices and m edges; multigraphs with m edges and multigraphs with n vertices and m edges. en_US
dc.publisher Elsevier en_US
dc.subject Graph Theory, Cycles en_US
dc.title Maximum number of cycles in graphs and multigraphs en_US
dc.degree.discipline Mathematics en_US
dc.contributor.examiningcommittee Doob, Michael (Mathematics) Kocay, William (Computer Science) Pikhurko, Oleg (Mathematics Institute, University of Warwick) en_US
dc.degree.level Doctor of Philosophy (Ph.D.) en_US
dc.description.note October 2018 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

View Statistics