Characterization and recognition of Helly circular-arc clique-perfect graphs
References (10)
- et al.
Partial characterizations of clique-perfect graphs
Electron. Notes Discrete Math.
(2005) - F. Bonomo, G. Durán, M. Groshaus, and J. Szwarcfiter, On clique-perfect and K-perfect graphs, Ars Comb., to...
- et al.
Recognizing Berge Graphs
Combinatorica
(2005) - M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas, The Strong Perfect Graph Theorem, Ann. Math., to...
- et al.
Clique-independent sets on Helly circular-arc graphs
Electron. Notes Discrete Math.
(2004)
There are more references available in the full text version of this article.
Cited by (1)
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
2009, Discrete MathematicsCitation Excerpt :An interesting survey on graph classes can be found in [27]. Preliminary results of this paper were published in [5,7]. [8]
- 1
Partially supported by UBACyT Grant X184, PICT ANPCyT Grant 11-09112 and PID Conicet Grant 644/98, Argentina and CNPq under PROSUL project Proc. 490333/2004-4, Brazil.
- 2
Partially supported by FONDECyT Grant 1050747 and Millennium Science Nucleus “Complex Engineering Systems”, Chile and CNPq under PROSUL project Proc. 490333/2004-4, Brazil.
Copyright © 2005 Elsevier B.V. All rights reserved.