Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set

DOI10.1007/978-3-662-44465-8_6zbMath1426.05077OpenAlexW1591656279MaRDI QIDQ2922596

Pim van 't Hof, Rémy Belmonte, Marcin Kaminski, Daniël Paulusma

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/14214/1/14214.pdf

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (4)

The Price of Connectivity for Cycle Transversals ⋮ Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs ⋮ The price of connectivity for feedback vertex set ⋮ The price of connectivity for cycle transversals

This page was built for publication: Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set