The decycling number of outerplanar graphs
From MaRDI portal
Publication:1956257
DOI10.1007/s10878-012-9455-1zbMath1273.90222MaRDI QIDQ1956257
Min-Yun Lien, Huilan Chang, Hung-Lin Fu
Publication date: 13 June 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9455-1
Related Items
Domination number and feedback vertex number of complements of line graphs, Feedback arc number and feedback vertex number of Cartesian product of directed cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum induced trees in graphs
- Approximation algorithms for combinatorial problems
- Size bounds for dynamic monopolies
- Local majorities, coalitions and monopolies in graphs: A review
- Minimum feedback vertex set and acyclic coloring.
- Feedback vertex sets and cyclically reducible graphs
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- ON DISJOINT CYCLES
- Decycling graphs