Sciweavers

Share
2 search results - page 1 / 1
» Partial characterizations of clique-perfect graphs I: Subcla...
Sort
View
DAM
2008
87views more  DAM 2008»
8 years 6 months ago
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
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...
Flavia Bonomo, Maria Chudnovsky, Guillermo Dur&aac...
ENDM
2008
118views more  ENDM 2008»
8 years 6 months ago
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
Flavia Bonomo, Guillermo Durán, Francisco J...
books