Corrigendum to ``Cycle transversals in perfect graphs and cographs

DOI10.1016/J.TCS.2013.03.022zbMATH Open1292.68082OpenAlexW2024758362MaRDI QIDQ387014FDOQ387014

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

Publication date: 11 December 2013

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

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

zbMATH Keywords

cographsfeedback vertex setperfect graphscycle transversals

Mathematics Subject Classification ID

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

Cites Work

• Planar Formulae and Their Uses
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• Cycle transversals in perfect graphs and cographs
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• Partition into cliques for cubic graphs: Planar case, complexity and approximation

Cited In (1)

• Corrigendum to: ``Independent transversal domination in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387014)