Pages that link to "Item:Q2097177"
From MaRDI portal
The following pages link to Some tight bounds on the minimum and maximum forcing numbers of graphs (Q2097177):
Displaying 7 items.
- Bounds on the forcing numbers of bipartite graphs (Q817753) (← links)
- Relations between global forcing number and maximum anti-forcing number of a graph (Q2078844) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- On tight bounds for the \(k\)-forcing number of a graph (Q2421385) (← links)
- (Q4984549) (← links)
- (Q4984796) (← links)
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs (Q6073878) (← links)