2000 character limit reached
Clique cycle-transversals in distance-hereditary graphs (1302.1402v2)
Published 6 Feb 2013 in cs.DM and math.CO
Abstract: A cycle-transversal of a graph G is a subset T of V(G) such that T intersects every cycle of G. A clique cycle-transversal, or cct for short, is a cycle-transversal which is a clique. Recognizing graphs which admit a cct can be done in polynomial time; however, no structural characterization of such graphs is known. We characterize distance-hereditary graphs admitting a cct in terms of forbidden induced subgraphs. This extends similar results for chordal graphs and cographs.