Nonrepetitive Colourings

Files
dujmovic.pdf (2.18 MB)
Author(s)
Dujmovic, Vida
Advisor(s)
Editor(s)
Associated Organization(s)
Organizational Unit
Organizational Unit
Series
Series
Collections
Scholarly Events
Supplementary to:
Permanent Link
http://hdl.handle.net/1853/44177
Abstract
A vertex colouring of a graph is nonrepetitive if there is no path whose first half receives the same sequence of colours as the second half. This talk will present some results on nonrepetitive colourings of planar graphs and graphs of bounded degree.
Sponsor
Date
2012-05
Extent
Resource Type
Text
Resource Subtype
Proceedings
Rights Statement
Rights URI