A feedback vertex set of 2-degenerate graphs

DOI10.1016/j.tcs.2014.08.016zbMath1339.05380OpenAlexW2021777257MaRDI QIDQ300250

Ewa Drgas-Burchardt, Elżbieta Sidorowicz, Mieczysław Borowiecki

Publication date: 27 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.08.016

zbMATH Keywords

feedback vertex set2-degenerate graphsdecycling set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

The size of graphs with given feedback vertex number ⋮ Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth ⋮ Feedback vertex number of Sierpiński-type graphs

Cites Work

• A linear-time algorithm for the weighted feedback vertex problem on interval graphs
• Feedback vertex set in hypercubes
• On the maximum induced forests of a connected cubic graph without triangles
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• Almost exact minimum feedback vertex set in meshes and butterflies
• Note to the paper of Grünbaum on acyclic colorings
• The integrity of a cubic graph
• Minimum feedback vertex set and acyclic coloring.
• Wavelength Conversion in Optical Networks
• Lower Bounds For Induced Forests in Cubic Graphs
• Decycling graphs
• k-Degenerate Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A feedback vertex set of 2-degenerate graphs