Self-Complementary Graphs and Generalisations


    Writing the manual was like working on a four-hundred piece jigsaw puzzle, except that instead of houses and trees, the pieces contained theorems and equations, sometimes in different languages and very different notation, not to mention that they were (literally) scattered around the globe. For helping me to gather some of the pieces, I must thank all those who generously sent reprints of their papers (and sometimes even other people's papers) :

I would also like to thank the following people for their help:     I am very grateful to Brian Alspach for suggesting Juraj Bosák's Decompositions of graphs when I was still starting on my research. It is an excellent survey book which I have often referred to both for content and style; and from which I first learnt that there is more to self-complementary graphs than the "n = 0 or 1 (mod 4)'' lemma.

    I thank Prof. Fiorini for his patience and help; and my parents for their support. Last, but definitely not least, I would like to thank my sister Nadine who drew and re-drew (and re-drew) the diagrams; unfortunately I had to convert them to bitmap format, with a consequent loss in quality. On future versions of the manual I hope to use xfig or some similar package that can save diagrams in Postscript or LaTeX format.

Written on: 31st October, 1999.
Last updated: 5th January, 2001.
Home page:
This page: