1. Abbas N (1995) Graph clustering: complexity, sequential and parallel algorithms. Ph.D. thesis, University of Alberta, Edmonton, Canada
2. Alekseev VE, Farrugia A, Lozin VV (2004) New results on generalized graph coloring. Discrete Math Theor Comput Sci 6:215–222
3. Alon N, McDiarmid C, Reed B (1991) Acyclic coloring of graphs. Random Struct Algorithm 2:277–288
4. Berge C (1987) Hypergraphs. Gauthier-Villars, Paris
5. Berger A (2001) Minimal forbidden subgraphs of reducible graph properties. Discuss Math Graph Theory 21:111–117