Connected Feedback Vertex Set in Planar Graphs

DOI10.1007/978-3-642-11409-0_13zbMath1273.68409OpenAlexW1530482171MaRDI QIDQ5851101

Alexander Grigoriev, R. A. Sitters

Publication date: 21 January 2010

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_13

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (14)

Finding good 2-partitions of digraphs. I. Hereditary properties ⋮ Finding good 2-partitions of digraphs. II. Enumerable properties ⋮ Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity ⋮ The Price of Connectivity for Cycle Transversals ⋮ Degree-constrained 2-partitions of graphs ⋮ Connecting face hitting sets in planar graphs ⋮ On the price of independence for vertex cover, feedback vertex set and odd cycle transversal ⋮ Connected feedback vertex set on AT-free graphs ⋮ Unnamed Item ⋮ The price of connectivity for feedback vertex set ⋮ FPT algorithms for connected feedback vertex set ⋮ Unnamed Item ⋮ On cycle transversals and their connected variants in the absence of a small linear forest ⋮ The price of connectivity for cycle transversals

This page was built for publication: Connected Feedback Vertex Set in Planar Graphs