Pages that link to "Item:Q817753"
From MaRDI portal
The following pages link to Bounds on the forcing numbers of bipartite graphs (Q817753):
Displaying 14 items.
- Complete forcing numbers of primitive coronoids (Q328729) (← 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)
- The graph of perfect matching polytope and an extreme problem (Q1044975) (← links)
- Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids (Q1714113) (← links)
- Continuous forcing spectra of even polygonal chains (Q2025175) (← links)
- Some tight bounds on the minimum and maximum forcing numbers of graphs (Q2097177) (← links)
- Complete forcing numbers of catacondensed hexagonal systems (Q2344000) (← links)
- On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes (Q2410263) (← links)
- Divisibility of an eigenform by an eigenform (Q2862167) (← links)
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs (Q6073878) (← links)
- Maximum fractional forcing number of the powers of even cycles (Q6101396) (← links)
