Share  Bookmark

 Download from



[1] G.A. Cheston and G. Fricke, Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance. Discrete Appl. Math. 55 (1994) 241258.
[2] E.J. Cockayne, O. Favaron, C. Payan and A.G. Thomason, Contributions to the theory of domination, independence and irredundance in graphs. Discrete Math. 33 (1981) 249258.
[3] M.C. Golumbic and R.C. Laskar, Irredundancy in circular arc graphs. Discrete Appl. Math. 44 (1993) 7989.
[4] P.L. Hammer and F. Maffray, Preperfect graphs. Combinatorica 13 (1993) 199208.
[5] M.A. Henning, Irredundance perfect graphs. Discrete Math. 142 (1995) 107120.
[6] M.S. Jacobson and K. Peters, A note on graphs which have upper irredundance equal to independence. Discrete Appl. Math. 44 (1993) 9197.
[7] M.S. Jacobson and K. Peters, Chordal graphs and upper irredundance, upper domination and independence. Discrete Math. 86 (1990) 5969.
[8] J. Topp, Domination, independence and irredundance in graphs. Dissertationes Math. 342 (1995) 99 pp.
[9] L. Volkmann, private communication.
[10] I.E. Zverovich and V.E. Zverovich, An induced subgraph characterization of domination perfect graphs. J. Graph Theory 20 (1995) 375395.