Connected feedback vertex set in planar graphs

DOI10.1007/978-3-642-11409-0_13MaRDI QIDQ5851101zbMATH OpenOpenAlexFDO

Authors Alexander Grigoriev, René 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

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

Recommendations

• On finding two-connected subgraphs in planar graphs
• Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
• Minimum face-spanning subgraphs of plane graphs
• Algorithms – ESA 2005
• Complexity and Approximation Results for the Connected Vertex Cover Problem

Cited in

(20)

• On cycle transversals and their connected variants in the absence of a small linear forest
• Connecting face hitting sets in planar graphs
• Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
• Finding good 2-partitions of digraphs. I. Hereditary properties
• FPT algorithms for connected feedback vertex set
• Degree-constrained 2-partitions of graphs
• The price of connectivity for cycle transversals
• On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
• Minimum face-spanning subgraphs of plane graphs
• Independent transversals versus transversals
• Connected feedback vertex set on AT-free graphs
• Feedback vertex set on Hamiltonian graphs
• Connected feedback vertex set on AT-free graphs
• scientific article; zbMATH DE number 7378380 (Why is no real title available?)
• Nonpartisan feedback vertex set
• Finding good 2-partitions of digraphs. II. Enumerable properties
• The price of connectivity for feedback vertex set
• The price of connectivity for cycle transversals
• An approximate kernel for connected feedback vertex set
• Small feedback vertex sets in planar digraphs

This page was built for publication: Connected feedback vertex set in planar graphs

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