Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphsReport as inadecuate




Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs - Download this document for free, or read online. Document in PDF available to download.

Resumen

A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique-transversal number and clique-independence number of G are the sizes of a minimum clique-transversal and a maximum clique-independent set of G, respectively. A graph G is clique-perfect if these two numbers are equal for every induced subgraph of G. The list of minimal forbidden induced subgraphs for the class of clique-perfect graphs is not known. In this paper, we present a partial result in this direction; that is, we characterize clique-perfect graphs by a restricted list of forbidden induced subgraphs when the graph belongs to two different subclasses of claw-free graphs.



Author: Bonomo, Flavia; - Chudnovsky, Maria; - Durán Maggiolo, Guillermo; -

Source: http://repositorio.uchile.cl/



DOWNLOAD PDF




Related documents