Corrigendum to ``Cycle transversals in perfect graphs and cographs
From MaRDI portal
Publication:387014
DOI10.1016/j.tcs.2013.03.022zbMath1292.68082OpenAlexW2024758362MaRDI QIDQ387014
Fábio Protti, Synara Brito, Andreas Brandstädt, Loana Tito Nogueira, Sulamita Klein
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
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)
Cites Work
- Partition into cliques for cubic graphs: Planar case, complexity and approximation
- 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
- Planar Formulae and Their Uses
This page was built for publication: Corrigendum to ``Cycle transversals in perfect graphs and cographs
