Pages that link to "Item:Q426841"
From MaRDI portal
The following pages link to Largest and smallest minimal percolating sets in trees (Q426841):
Displaying 14 items.
- Maximal induced paths and minimal percolating sets in hypercubes (Q307899) (← links)
- The time of bootstrap percolation with dense initial sets (Q400563) (← links)
- Minimal percolating sets in bootstrap percolation (Q1010903) (← links)
- Neighborhood growth dynamics on the Hamming plane (Q1676791) (← links)
- Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach (Q1727735) (← links)
- Minimum degree conditions for small percolating sets in bootstrap percolation (Q2185227) (← links)
- Percolating sets in bootstrap percolation on the Hamming graphs and triangular graphs (Q2225448) (← links)
- Minimal spanning tree and percolation on mosaics: graph theory and percolation (Q4262469) (← links)
- Bootstrap Percolation on Degenerate Graphs (Q4685764) (← links)
- Deterministic bootstrap percolation on trees (Q5045263) (← links)
- Maximal Spanning Time for Neighborhood Growth on the Hamming Plane (Q5232138) (← links)
- Bootstrap percolation via automated conjecturing (Q5881012) (← links)
- New ordering methods to construct contagious sets and induced degenerate subgraphs (Q6102104) (← links)
- Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation (Q6563985) (← links)