Connecting face hitting sets in planar graphs

DOI10.1016/j.ipl.2010.10.008zbMath1259.05048OpenAlexW2083096289MaRDI QIDQ1944026

Pascal Schweitzer, Patrick Schweitzer

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.10.008

zbMATH Keywords

combinatorial problemsplanar graphface hitting set

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity ⋮ The Price of Connectivity for Cycle Transversals ⋮ Splitting plane graphs to outerplanarity ⋮ The price of connectivity for feedback vertex set ⋮ Complete metrics of bounded curvature on noncompact manifolds ⋮ The price of connectivity for cycle transversals

Cites Work

• Unnamed Item
• Unnamed Item
• On the minimum corridor connection problem and other generalized geometric problems
• FPT Algorithms for Connected Feedback Vertex Set
• A Linear Kernel for Planar Feedback Vertex Set
• Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
• Connected Feedback Vertex Set in Planar Graphs

This page was built for publication: Connecting face hitting sets in planar graphs