Corrigendum to ``Cycle transversals in perfect graphs and cographs

DOI10.1016/J.TCS.2013.03.022MaRDI QIDQ387014zbMATH OpenOpenAlexFDO

Authors Andreas Brandstädt, Synara Brito, Loana T. Nogueira, Fábio Protti, 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

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

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

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)