%% Dear Jurriaan,
%%
%% I noticed that you have a dvi-file on 2ss and switchings
%% on the Web.
%% Here comes some references that you might want to add there.
%%
%% UNFORTUNATELY this file is taken from a monograph, and the
%% \bibitem item is rather complicated!
%%

\documentclass[a4paper]{article}

\newcommand{\JGT}{{\em J. of Graph Theory}}
\newcommand{\DM}{{\em Discrete Math.}}
\newcommand{\DAM}{{\em Discrete Appl. Math.}}
\newcommand{\AmerMM}{{\em Amer. Math. Monthly}}
\newcommand{\JCombB}{{\em J. Combin. Theory Ser.\, B}}
\newcommand{\JCombA}{{\em J. Combin. Theory Ser.\, A}}


\bib{Bate1}
{\AU{N.G}{Bate}}{%
Circuits of Edge-Coloured Complete Graphs}
{Ph.D. Thesis, Univ. of Keele.%, England
}{}{1981}{}


\bib{Bate2}
{\AU{N.G}{Bate}}{%
Complete graphs without polychromatic circuits}
{\DM}{46,}{1983}{1--8.}


\bib{Bosak}
{\AU{J}{Bos\'{a}k}}{%
``Decompositions of Graphs''}{Kluwer.}{}{1990}{}


\bib{Brewster}
{\AU{R}{Brewster}}{%
The complexity of colouring symmetric relational systems}
{\DAM}{49,}{1994}{95--105.}

\bib{Butterworth}
{\AU{R.W}{Butterworth}}{%
A set theoretic treatment of coherent systems}
{\em SIAM J. Appl. Math.}{22,}{1972}{590--598.}


\bib{CheinHabib}
{\AU{M}{Chein}, \AUs{M}{Habib} and \AUs{M.C}{Maurer}}{%
Partitive hypergraphs}
{\DM}{37,}{1981}{35--50.}

\bib{CG}
{\AU{F.R.K}{Chung} and \AUs{R.L}{Graham}}{%
Recent results in graph decompositions}
{in ``Combinatorics. Proceedings of the Eighth British
Combinatorial Conference'', H.N.V. Temperley, ed.,
\Cambridge,}{}{1981}{pp. 103--123.}


\bib{Cun}
{\AU{W.H}{Cunningham}}{%
Decomposition of directed graphs}
{\em SIAM J. Alg. Disc. Meth.}{3}
{1982}{214--228.}




\bib{EZ}
{\AU{A}{Ehrenfeucht} and \AUs{M.W}{Zawadowski}}{%
A representation of partial boolean algebras}
{\em Fund. Inform.}{16,}{1992}{349--353.}



\bib{Fraisse}
{\AU{R}{Fraisse}}{%
L'intervalle en th\'{e}orie des relations, ses
g\'{e}n\'{e}ralisations, filtre intervallaire et cl\^{o}ture d'une
relation}
{in ``Orders, Description and Roles'', M. Pouzet, D. Richard, eds.,
{\em Ann. Discrete Math.}{\bf 23}{North Holland},}{}{1984}{pp. 313--341.}



\bib{Fujishige}
{\AU{S}{Fujishige}}{%
Canonical decompositions of symmetric submodular systems}
{dam}{5,}{1983}{175--190.}



\bib{Gal}
{\AU{T}{Gallai}}{%
Transitiv orientierbare Graphen}
{\em Acta Math. Acad. Sci. Hungar.}{18,}{1967}{25--66.}

\bib{Habib-PHd}
{\AU{M}{Habib}}{%
Substitution des structures combinatoire, theorie et algorithmes}
{Ph.D. Thesis, Paris.}{}{1981}{}



\bib{HabibHSpin}
{\AU{M}{Habib}, \AUs{M}{Huchard} and \AUs{J}{Spinrad}}{%
A linear algorithm to decompose inheritance graphs into modules}
{\em Algorithmica}{13,}{1995}{573--591.}



\bib{Habib}
{\AU{M}{Habib} and \AUs{M.C}{Maurer}}{%
On the X-join decomposition for undirected graphs}
{DAM}{1,}{1979}{201--207.}




\bib{Harary-RW}
{\AU{F}{Harary}, \AUs{R.W}{Robinson} and \AUs{N.C}{Wormald}}{%
Isomorphic factorisations I: Complete graphs}
{\em Trans. Amer. Math. Soc.}{242,}{1978}{243--260.}



\bib{Hemminger}
{\AU{R.L}{Hemminger}}{%
The group of an X-join of graphs}
{\em J. Combin. Theory}{5,}{1968}{408--418.}



\bib{Ille-multi}
{\AU{P}{Ille}}{%
L'ensemble des intervalles d'une multirelation binaire et reflexive}
{\em Z. Math. Logik Grundlagen Math}{37,}{1991}{227--256.}


\bib{Ille-hypo}
{\AU{P}{Ille}}{%
Recognition problem in construction for decomposable relations}
{in ``Finite and Infinite Combinatorics in Sets and Logic'',
Sauer, N.W., ed., Kluwer Acad. Publ.,}{}{1993}{pp. 189--198.}



\bib{Ille-inf}
{\AU{P}{Ille}}{%
Graphes indecomposables infinis}
{\em C.R. Acad. Sci., Paris Ser. I}{318,}{1994}{499--503.}


\bib{Ille}
{\AU{P}{Ille}}{%
Indecomposable graphs}
{\DM}{173,}{1997}{71--78.}



\bib{JSC}
{\AU{L.O}{James}, \AUs{R.G}{Stanton} and \AUs{D.D}{Cowan}}{%
Graph decomposition for undirected graphs}
{in ``Proc. Third Southeastern Conf. on Combinatorics,
Graph Theory, and Computing'',
F. Hoffman, R.B. Levow and R.S.D. Thomas, eds.,
Florida Atlantic Univ.,}{}{1972}{pp. 281--290.}


\bib{JensenToft}
{\AU{T.R}{Jensen} and \AUs{B}{Toft}}{%
``Graph Coloring Problems''}
{Wiley.}{}{1995}{}


\bib{Kelly}
{\AU{D}{Kelly}}{%
Comparability graphs}
{in ``Graphs and Order'', I. Rival, ed., Reidel,}{}{1985}{pp. 3--40.}


\bib{KrasRod}
{\AU{L}{Krasikov} and \AUs{Y}{Roditty}}{%
Balance equations for reconstruction problems}
{\em Arch. Math.}{48,}{1987}{458--464.}


\bib{Maurer}
{\AU{M.C}{Maurer}}{%
Joints et d\'{e}compositions premi\`{e}res dans les graphes}
{Th\`{e}se 3\`{e}me cycle, Universit\'{e} Paris VI.}{}{1977}{}


\bib{Mc-Spinrad}
{\AU{R.M}{McConnell} and \AUs{J}{Sprinrad}}{%
Linear-time modular decomposition and efficient transitive orientation
of comparability graphs}
{in ``Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms'',
Arlington, USA,}{}{1994}{pp. 536--545.}



\bib{Mohring}
{\AU{R.H}{M\"{o}hring}}{%
An algebraic decomposition theory for discrete structures}
{in ``Universal Algebra and its Links with Logic, Algebra,
combinatorics and Computer Science'',
B. Burmeister, ed., Heldermann Verlag,}{}{1984a}{pp. 191--203.}



\bib{Mohring-subs}
{\AU{R.H}{M\"{o}hring}}{%
Algorithmic aspects of the substitution decomposition in
optimization over relations, set systems and Boolean functions}
{\em Ann. Operat. Res.}{4,}{1985b}{195--225.}


\bib{MR}
{\AU{R.H}{M\"{o}hring} and \AUs{F.J}{Radermacher}}{%
Substitution decomposition for discrete structures
and connections with combinatorial optimization}
{\em Ann. Discrete Math.}{19,}{1984}{257--355.}



\bib{MS-89}
{\AU{J.H}{Muller} and \AUs{J}{Spinrad}}{%
Incremental modular decomposition}
{\em J. Assoc. Comput. Mach.}{36,}{1989}{1--19.}


\bib{RobGold1}
{\AU{A.G}{Robinson} and \AUs{A.J}{Goldman}}{%
On Ringeisen's isolation game}
{\DM}{80,}{1990}{297--312.}


\bib{RobGold2}
{\AU{A.G}{Robinson} and \AUs{A.J}{Goldman}}{%
On Ringeisen's isolation game. II}
{\DM}{90,}{1991}{153--167.}


\bib{Robinson}
{\AU{R.W}{Robinson}}{%
Isomorphic factorizations VI: Automorphisms}
{in ``Combinatorial Math. VI'',
Lect. Notes Math.}{748,}{1979}{127--136.}


\bib{Sabidussi}
{\AU{G}{Sabidussi}}{%
Graph derivatives}
{\em Math. Z.}{76,}{1961}{385--401.}


\bib{Spinrad-pfour}
{\AU{J}{Spinrad}}{%
$P_4$-trees and substitution decomposition}
{DAM}{39,}{1992}{263--291.}



\bib{Wagner}
{\AU{D}{Wagner}}{%
Decomposition of k-ary relations}
{\DM}{81,}{1990}{303--322.}