Pages that link to "Item:Q1827691"
From MaRDI portal
The following pages link to On the forced matching numbers of bipartite graphs (Q1827691):
Displayed 28 items.
- The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice (Q283197) (← links)
- Uniquely forced perfect matching and unique 3-edge-coloring (Q323081) (← links)
- Complete forcing numbers of primitive coronoids (Q328729) (← links)
- Anti-forcing spectra of perfect matchings of graphs (Q511717) (← links)
- Extremal anti-forcing numbers of perfect matchings of graphs (Q526817) (← links)
- On forcing matching number of boron-nitrogen fullerene graphs (Q642986) (← links)
- The global forcing number of the parallelogram polyhex (Q713327) (← links)
- The forcing number of toroidal polyhexes (Q937596) (← links)
- Forcing matching numbers of fullerene graphs (Q968177) (← links)
- Global forcing number for maximal matchings (Q1690248) (← 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)
- The minimum forcing number of perfect matchings in the hypercube (Q1727779) (← links)
- Forcing polynomials of benzenoid parallelogram and its related benzenoids (Q1733459) (← links)
- Continuous forcing spectra of even polygonal chains (Q2025175) (← links)
- Some tight bounds on the minimum and maximum forcing numbers of graphs (Q2097177) (← links)
- Continuous forcing spectrum of regular hexagonal polyhexes (Q2139775) (← links)
- Some novel minimax results for perfect matchings of hexagonal systems (Q2166259) (← links)
- Global forcing number for maximal matchings in corona products (Q2172838) (← links)
- Complete forcing numbers of catacondensed hexagonal systems (Q2344000) (← links)
- On the computational complexity of defining sets (Q2387433) (← links)
- On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes (Q2410263) (← links)
- Global forcing number of benzenoid graphs (Q2644398) (← links)
- Forcing and anti-forcing polynomials of a type of polyomino graphs (Q2687507) (← links)
- The forcing edge covering number of a graph (Q2892108) (← 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)