Pages that link to "Item:Q4560210"
From MaRDI portal
The following pages link to Tight upper bound on the maximum anti-forcing numbers of graphs (Q4560210):
Displaying 8 items.
- Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids (Q1714113) (← links)
- Anti-forcing polynomials for benzenoid systems with forcing edges (Q1801080) (← links)
- Relations between global forcing number and maximum anti-forcing number of a graph (Q2078844) (← links)
- Some tight bounds on the minimum and maximum forcing numbers of graphs (Q2097177) (← links)
- The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes (Q2139808) (← links)
- Some novel minimax results for perfect matchings of hexagonal systems (Q2166259) (← links)
- On tight bounds for the \(k\)-forcing number of a graph (Q2421385) (← links)
- Forcing and anti-forcing polynomials of a type of polyomino graphs (Q2687507) (← links)