On minimal imperfect graphs without induced P5 - Archive ouverte HAL
Article Dans Une Revue Discrete Applied Mathematics Année : 1999

On minimal imperfect graphs without induced P5

Résumé

In this paper, we summarize previous known results on P5-free minimal imperfect graphs (i.e. minimal imperfect graphs not containing a path on 5 vertices as induced subgraph) and we introduce two new classes of graphs (defined by a local property) that contain P5-free graphs. Next, we show that most of the results concerning P5-free graphs can be extended to these classes. Moreover, we present a structural characterization of these graphs which leads to some new results. In particular, we prove that the Strong Perfect Graph Conjecture holds true for P5-free and F-free graphs where F is any connected configuration on 5 vertices not containing an induced 2K2.

Dates et versions

hal-02084787 , version 1 (29-03-2019)

Identifiants

Citer

Vincent Barré, Jean-Luc Fouquet. On minimal imperfect graphs without induced P5. Discrete Applied Mathematics, 1999, 94 (1-3), pp.9-33. ⟨10.1016/S0166-218X(99)00012-8⟩. ⟨hal-02084787⟩
42 Consultations
0 Téléchargements

Altmetric

Partager

More