The following pages link to Dynamic approach to k-forcing (Q5225512):
Displaying 26 items.
- Proof of a conjecture on the zero forcing number of a graph (Q313827) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- On a conjecture of Gentner and Rautenbach (Q1699556) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- The zero forcing polynomial of a graph (Q1732095) (← links)
- A computational study of \(f\)-reversible processes on graphs (Q1752484) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Total forcing versus total domination in cubic graphs (Q2011113) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- Zero forcing versus domination in cubic graphs (Q2025087) (← links)
- On the zero forcing number and spectral radius of graphs (Q2121770) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- From the editor-in-chief (Q2226443) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- The Zero Forcing Number of Graphs (Q4610449) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- Zero forcing number of a graph in terms of the number of pendant vertices (Q4965925) (← links)
- (Q5076794) (← links)
- Immune sets in monotone infection rules. Characterization and complexity (Q6064851) (← links)
- UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS (Q6124016) (← links)
- On graphs maximizing the zero forcing number (Q6157420) (← links)
- Bounding the total forcing number of graphs (Q6181334) (← links)
- Bounds on zero forcing using (upper) total domination and minimum degree (Q6601135) (← links)
- On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs (Q6633544) (← links)
