Pages that link to "Item:Q479006"
From MaRDI portal
The following pages link to Upper bounds on the \(k\)-forcing number of a graph (Q479006):
Displayed 24 items.
- Fractional zero forcing via three-color forcing games (Q313806) (← links)
- Proof of a conjecture on the zero forcing number of a graph (Q313827) (← links)
- Extremal values and bounds for the zero forcing number (Q317429) (← links)
- Zero forcing propagation time on oriented graphs (Q526815) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- On a conjecture of Gentner and Rautenbach (Q1699556) (← links)
- Infection in hypergraphs (Q1701092) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- The relationship between \(k\)-forcing and \(k\)-power domination (Q1744766) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← 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)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Zero forcing number of degree splitting graphs and complete degree splitting graphs (Q2305124) (← links)
- A computational comparison of compact MILP formulations for the zero forcing number (Q2328106) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- On tight bounds for the \(k\)-forcing number of a graph (Q2421385) (← links)
- The Zero Forcing Number of Graphs (Q4610449) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- Matching, path covers, and total forcing sets (Q5215393) (← links)