Cycle transversals in perfect graphs and cographs

DOI10.1016/j.tcs.2012.10.030zbMath1259.68077OpenAlexW2057355493MaRDI QIDQ1935798

Loana Tito Nogueira, Andreas Brandstädt, Sulamita Klein, Fábio Protti, Synara Brito

Publication date: 19 February 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.030

zbMATH Keywords

perfect graphscographsfeedback vertex setcycle transversals

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (11)

Clique cycle-transversals in distance-hereditary graphs ⋮ On equistable, split, CIS, and related classes of graphs ⋮ Corrigendum to ``Cycle transversals in perfect graphs and cographs ⋮ Independent feedback vertex sets for graphs of bounded diameter ⋮ Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration ⋮ Partitioning \(P_4\)-tidy graphs into a stable set and a forest ⋮ Sparse Graphs Are Near-Bipartite ⋮ Independent feedback vertex set for \(P_5\)-free graphs ⋮ Recognizing Graphs Close to Bipartite Graphs ⋮ Granular computing on basic digraphs ⋮ Independent Feedback Vertex Set for P_5-free Graphs

This page was built for publication: Cycle transversals in perfect graphs and cographs