Irredundance Perfect and P6-free Graphs

Journal of Graph Theory

Volumn 29, Issue 4, 1998, Pages 239-255

  Puech, Joël ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Domination; Forbidden subgraphs; Irredundance

Indexed keywords

EID: 0032327109     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199812)29:4<239::AID-JGT3>3.0.CO;2-M     Document Type: Article

References (6)

1. B. Bollobás and E. J. Cockayne, Graph-theoretic parameters concerning domination, independence, and irredundance, J. GraphTheory 3 (1979), 241-249.
2. E. J. Cockayne, P. J. P. Grobler, S. T. Hedetniemi, and A. A. McRae, What makes an irredundant maximal? J. Combin. Math. Combin. Comput. 25 (1997), 213-223.
3. R. Faudree, O. Favaron, and H. Li, Independence, domination, irredundance, and forbidden pairs, J. Combin. Math. Combin. Comput. 26 (1998), 193-212.
4. O. Favaron, Stability, domination and irredundance in a graph, J. Graph Theory 10 (1986), 429-438.
5. M. A. Henning, Irredundance perfect graphs, Discr. Mathematics 142 (1995), 107-120.
6. J. Puech, Irredundance perfection and forbidden pairs, J. Combin. Math. Combin. Comput., to appear.