The following pages link to (Q5408293):
Displaying 19 items.
- A maximum resonant set of polyomino graphs (Q274682) (← links)
- A minimax result for perfect matchings of a polyomino graph (Q277641) (← links)
- The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice (Q283197) (← links)
- Anti-forcing spectra of perfect matchings of graphs (Q511717) (← links)
- Anti-forcing spectrum of any cata-condensed hexagonal system is continuous (Q1692699) (← links)
- Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids (Q1714113) (← links)
- Forcing polynomials of benzenoid parallelogram and its related benzenoids (Q1733459) (← 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)
- Continuous forcing spectrum of regular hexagonal polyhexes (Q2139775) (← links)
- The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes (Q2139808) (← links)
- Some novel minimax results for perfect matchings of hexagonal systems (Q2166259) (← links)
- On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes (Q2410263) (← links)
- Forcing and anti-forcing polynomials of a type of polyomino graphs (Q2687507) (← links)
- Matching Forcing Polynomials of Constructable Hexagonal Systems (Q5050743) (← links)
- Anti-forcing numbers of perfect matchings of graphs (Q5962519) (← links)
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs (Q6073878) (← links)
- Removable and forced subgraphs of graphs (Q6495257) (← links)
