Feedback vertex sets in cubic multigraphs
From MaRDI portal
Publication:2515555
DOI10.1016/j.disc.2015.05.029zbMath1318.05039OpenAlexW634408543MaRDI QIDQ2515555
Dieter Rautenbach, Michael Gentner
Publication date: 5 August 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.05.029
Related Items (5)
Decycling with a matching ⋮ Boundary classes for graph problems involving non-local properties ⋮ Degenerate matchings and edge colorings ⋮ Feedback arc number and feedback vertex number of Cartesian product of directed cycles ⋮ Anchored Hyperspaces and Multigraphs.
Cites Work
- Unnamed Item
- On the maximum induced forests of a connected cubic graph without triangles
- Large induced degenerate subgraphs
- The integrity of a cubic graph
- A new bound on the feedback vertex sets in cubic graphs
- Large induced forests in sparse graphs
- Lower Bounds For Induced Forests in Cubic Graphs
- On feedback vertex sets and nonseparating independent sets in cubic graphs
This page was built for publication: Feedback vertex sets in cubic multigraphs
