Discrete Mathematics
Some results on maximum stable sets in certain P5-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Automated generation of conjectures on forbidden subgraph characterization
Discrete Applied Mathematics
| Hi-index | 0.00 |
The domination number γ(G) and the irredundancenumber ir(G) of a graph G have been consideredby many authors. It is well known that ir(G) ≤γ(G) holds for all graphs G, which leads us toconsider the concept of irredundance perfect graphs: graphs thathave all their induced subgraphs satisfying the equality betweenthe previous two parameters. In this article, we investigate twosubclasses of irredundance perfect graphs that are defined in termsof forbidden subgraphs, where in each case, one of the forbiddensubgraphs is the path P6. In particular, we provetwo conjectures, the first one due to Faudree, Favaron, and Li[Faudree et al., J Combin. Math., 1997], and the second one due toFavaron [Favaron, J Graph Theory, 1986]. © 1998 John Wiley& Sons, Inc. J Graph Theory 29: 239255, 1998