Clique cycle-transversals in distance-hereditary graphs

DOI10.1016/j.dam.2014.12.007zbMath1339.05084arXiv1302.1402OpenAlexW2011403320MaRDI QIDQ299045

Andreas Brandstädt, Fábio Protti, Simone Esposito, Loana Tito Nogueira

Publication date: 22 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.1402

zbMATH Keywords

distance-hereditary graphsfeedback vertex setclique cycle transversalcycle transversalforbidden induced subgraph characterization

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items

Granular computing on basic digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Finding odd cycle transversals.
• MSOL partitioning problems on graphs of bounded treewidth and clique-width
• Distance-hereditary graphs
• Partitioning chordal graphs into independent sets and cliques
• Partitions of graphs into one or two independent sets and cliques
• Cycle transversals in perfect graphs and cographs
• Linear time solvable optimization problems on graphs of bounded clique-width
• Complexity of graph partition problems
• Characterizing –partitionable Cographs
• Graph Classes: A Survey
• Node-and edge-deletion NP-complete problems