Pages that link to "Item:Q4798175"
From MaRDI portal
The following pages link to Decycling numbers of random regular graphs (Q4798175):
Displaying 16 items.
- Percolation with small clusters on random graphs (Q293653) (← links)
- Optimal segmentation of directed graph and the minimum number of feedback arcs (Q1683994) (← links)
- Minimal contagious sets in random regular graphs (Q2350108) (← links)
- A new formula for the decycling number of regular graphs (Q2404396) (← links)
- On giant components and treewidth in the layers model (Q2811162) (← links)
- Asymptotic estimate for the counting problems corresponding to the dynamical system on some decorated graphs (Q3176217) (← links)
- A spin glass approach to the directed feedback vertex set problem (Q3302766) (← links)
- Dismantling Sparse Random Graphs (Q3512603) (← links)
- Induced Forests in Regular Graphs with Large Girth (Q3545905) (← links)
- Independent domination in directed graphs (Q4957541) (← links)
- Cycle intersection graphs and minimum decycling sets of even graphs (Q4965894) (← links)
- Factor of IID Percolation on Trees (Q5298168) (← links)
- Hierarchical cycle-tree packing model for optimal \(K\)-core attack (Q6140935) (← links)
- Induced forests in some distance-regular graphs (Q6153467) (← links)
- Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← links)
- Spin Glass approach to the feedback vertex set problem (Q6176705) (← links)
