Amalgamations of Graphs
by
Chris Rodger
Auburn University

An amalgamation of a graph is a graph homomorphism. It is easy to amalgamate a graph, but reversing the process is not so straight forward. Indeed, given a graph H, there are likely to be many graphs which can be amalgamated to form H, some of which are more interesting than others. In this talk, an overview of the disentangling technique will be given, and a survey of results that can be obtained in this manner will be presented. This will include discussing such issues as hamilton cycles, connectivity properties, and balanced edge-colourings.

Date received: October 25, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafn-20.