scientific article; zbMATH DE number 2186982
From MaRDI portal
Publication:3025209
Recommendations
Cited in
(19)- New formulae for the decycling number of graphs
- The size of graphs with given feedback vertex number
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles
- A new formula for the decycling number of regular graphs
- Maximum induced forests of product graphs
- The decycling number of regular graphs
- scientific article; zbMATH DE number 1744105 (Why is no real title available?)
- Decycling number of a class of 4-regular graphs.
- Decycling numbers of random regular graphs
- Decycling bubble sort graphs
- Subgraph-avoiding minimum decycling sets and \(k\)-conversion sets in graphs
- The Forest Number of (n,m)-Graphs
- Decycling of Fibonacci cubes
- Decycling connected regular graphs
- An intermediate value theorem for the arboricities
- Upper-embeddability and the decycling number of connected 4-regular graphs
- On decycling and forest numbers of Cartesian products of trees
- On maximum induced forests of the balanced bipartite graphs
- An intermediate value theorem for the decycling numbers of Toeplitz graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3025209)