Similar Items: Feedback vertex sets of planar digraphs with fixed digirth
- Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
- Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
- A coarse Menger's Theorem for planar and bounded genus graphs
- Vertex connectivity of the nonzero nonunit core of the comaximal graph of $mathbb Z_n$
- Increasing arc-connectivity by bounded- and fixed-size inversions
- More on the ErdH os--Kleitman problem on matchings in set families