1. Some common properties for regularizable graphs, edge-critical graphs and B-graphs;Berge;Tohoku Univ. Tsuken Symp. on Graph Theory and Algorithms,1980
2. Contributions to the theory of domination, independence and irredundance in graphs;Cockayne;Discrete Math.,1981
3. O. Favaron, Graphes très bien couverts, Manuscrit.
4. M. Habib, Substitution des structures combinatoires, théorie et algorithmes, Thèse d'état, Université Paris VI.
5. Some covering concepts in graphs;Plummer;J. Combin. theory,1970