2006•Americanae (AECID Library)Open access

On clique-perfect and k-perfect graphs

Flavia Bonomo, Guillermo Durán, Marina Groshaus, Jayme Luiz SZWARCFITER

Abstract

A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H is equal to the cardinality of a minimum clique-transversal of H, for every induced subgraph H of G. When equality holds for every clique subgraph of G, the graph is c–clique-perfect. A graph G is K-perfect when its clique graph K(G) is perfect. In this work, relations are described among the classes of perfect, Kperfect, clique-perfect and c–clique-perfect graphs. Besides, partial characterizations of K-perfect graphs using polyhedral theory and clique subgraphs are formulated.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 29 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Combinatorics, Mathematics, Perfect graph, Split graph, Perfect graph theorem, Trivially perfect graph, Block graph, Strong perfect graph theorem