Decycling numbers of random regular graphs
From MaRDI portal
Recommendations
Cited in
(19)- Some bounds on the size of maximum G-free sets in graphs
- Decycling number of a class of 4-regular graphs.
- Decycling connected regular graphs
- Induced Forests in Regular Graphs with Large Girth
- A spin glass approach to the directed feedback vertex set problem
- Asymptotic estimate for the counting problems corresponding to the dynamical system on some decorated graphs
- Cycle intersection graphs and minimum decycling sets of even graphs
- Hierarchical cycle-tree packing model for optimal \(K\)-core attack
- Induced forests in some distance-regular graphs
- Percolation with small clusters on random graphs
- A new formula for the decycling number of regular graphs
- Dismantling Sparse Random Graphs
- Factor of iid percolation on trees
- Spin Glass approach to the feedback vertex set problem
- On giant components and treewidth in the layers model
- Independent domination in directed graphs
- scientific article; zbMATH DE number 2186982 (Why is no real title available?)
- Optimal segmentation of directed graph and the minimum number of feedback arcs
- Minimal contagious sets in random regular graphs
This page was built for publication: Decycling numbers of random regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798175)
