The following pages link to (Q4903414):
Displayed 24 items.
- A maximum resonant set of polyomino graphs (Q274682) (← links)
- A minimax result for perfect matchings of a polyomino graph (Q277641) (← links)
- Anti-forcing spectra of perfect matchings of graphs (Q511717) (← links)
- Extremal anti-forcing numbers of perfect matchings of graphs (Q526817) (← links)
- Anti-forcing spectrum of any cata-condensed hexagonal system is continuous (Q1692699) (← links)
- The minimum forcing number of perfect matchings in the hypercube (Q1727779) (← links)
- Forcing polynomials of benzenoid parallelogram and its related benzenoids (Q1733459) (← links)
- Forcing and anti-forcing edges in bipartite graphs (Q1752588) (← links)
- Anti-forcing polynomials for benzenoid systems with forcing edges (Q1801080) (← links)
- Plane elementary bipartite graphs with forcing or anti-forcing edges (Q2000588) (← links)
- Continuous forcing spectra of even polygonal chains (Q2025175) (← links)
- Complete forcing numbers of hexagonal systems (Q2046284) (← links)
- Colouring non-even digraphs (Q2094875) (← 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)
- Complete forcing numbers of hexagonal systems. II (Q2143442) (← links)
- Some novel minimax results for perfect matchings of hexagonal systems (Q2166259) (← links)
- Complete forcing numbers of catacondensed hexagonal systems (Q2344000) (← links)
- Matching Forcing Polynomials of Constructable Hexagonal Systems (Q5050743) (← links)
- Complete forcing numbers of graphs (Q5871599) (← links)
- Anti-forcing numbers of perfect matchings of graphs (Q5962519) (← links)
- Complete forcing numbers of complete and almost-complete multipartite graphs (Q6053962) (← links)
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs (Q6073878) (← links)