Triangle-Free Strongly Circular-Perfect Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics Année : 2009

Triangle-Free Strongly Circular-Perfect Graphs

Résumé

Zhu introduced circular-perfect graphs as a superclass of the well-known perfect graphs and as an important χ-bound class of graphs with the smallest non-trivial χ-binding function χ(G)≤ω(G)+1. Perfect graphs have been recently characterized as those graphs without odd holes and odd antiholes as induced subgraphs [M. Chudnovsky, N. Robertson, P. Seymour, R. Thomas, The strong perfect graph theorem, Ann. Math. (in press)]; in particular, perfect graphs are closed under complementation [L. Lovász, Normal hypergraphs and the weak perfect graph conjecture, Discrete Math. 2 (1972) 253–267]. To the contrary, circular-perfect graphs are not closed under complementation and the list of forbidden subgraphs is unknown. We study strongly circular-perfect graphs: a circular-perfect graph is strongly circular-perfect if its complement is circular perfect as well. This subclass entails perfect graphs, odd holes, and odd antiholes. As the main result, we fully characterize the triangle-free strongly circular-perfect graphs, and prove that, for this graph class, both the stable set problem and the recognition problem can be solved in polynomial time. Moreover, we address the characterization of strongly circular-perfect graphs by means of forbidden subgraphs. Results from suggest that formulating a corresponding conjecture for circular-perfect graphs is difficult; it is even unknown which triangle-free graphs are minimal circular-imperfect. We present the complete list of all triangle-free minimal not strongly circular-perfect graphs.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
ICGTfullpaper.pdf (159.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00308145 , version 1 (04-11-2008)

Identifiants

  • HAL Id : hal-00308145 , version 1

Citer

Sylvain Coulonges, Arnaud Pecher, Annegret K. Wagler. Triangle-Free Strongly Circular-Perfect Graphs. Discrete Mathematics, 2009, 309, pp.3632-3643. ⟨hal-00308145⟩
171 Consultations
212 Téléchargements

Partager

Gmail Facebook X LinkedIn More