The separator theorem for rooted directed vertex graphs
From MaRDI portal
Publication:1850517
DOI10.1006/JCTB.2000.2001zbMath1029.05066OpenAlexW2081091322MaRDI QIDQ1850517
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2000.2001
Related Items (3)
Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage ⋮ Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage ⋮ Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
Cites Work
This page was built for publication: The separator theorem for rooted directed vertex graphs
