Ringel's decomposition problem and graph labellings

Show simple item record

dc.contributor.author Rosa, Alexander
dc.date.accessioned 2017-05-18T19:13:14Z
dc.date.available 2017-05-18T19:13:14Z
dc.date.copyright 2017 en_US
dc.date.issued 2017-05-18
dc.identifier.uri http://hdl.handle.net/1828/8138
dc.description.abstract During the 1963 international graph theory conference in Smolenice, Czechoslovakia, Gerhard Ringel formulated the following conjecture: The complete graph with vertices can be decomposed into subgraphs, each isomorphic to a given tree with edges. Shortly thereafter, several kinds of graph labellings were introduced with the aim of attacking Ringel’s conjecture. Among these, the graceful labelling (originally called labelling) became the most prominent. Professor Alexander Rosa will attempt to present an overview of the up-to-date approaches to Ringel’s conjecture, and also to the well-known conjecture that every tree has a graceful labelling. en_US
dc.description.sponsorship Lansdowne Lecture Series en_US
dc.language.iso en en_US
dc.subject Graph theory en_US
dc.subject Mathematics en_US
dc.title Ringel's decomposition problem and graph labellings en_US
dc.type Video en_US
dc.description.scholarlevel Faculty en_US
dc.description.reviewstatus Unreviewed en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UVicSpace


My Account