Decycling with a matching

DOI10.1016/j.ipl.2017.04.003zbMath1416.05229OpenAlexW2607478305MaRDI QIDQ2628271

Uéverton S. Souza, Dieter Rautenbach, Carlos Vinícius G. C. Lima, Jayme Luiz Szwarcfiter

Publication date: 13 June 2017

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

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

zbMATH Keywords

matchinggraph algorithmsfeedback vertex setdecycling

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Perfect matching cuts partitioning a graph into complementary subgraphs ⋮ On the computational complexity of the bipartizing matching problem ⋮ Feedback arc number and feedback vertex number of Cartesian product of directed cycles

Cites Work

• Unnamed Item
• Maximum induced trees in graphs
• Distance-hereditary graphs
• Dominating subgraphs in graphs with some forbidden structures
• Dominating and large induced trees in regular graphs
• Feedback vertex sets in cubic multigraphs
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Decycling graphs

This page was built for publication: Decycling with a matching