Pages that link to "Item:Q4820537"
From MaRDI portal
The following pages link to On the spectrum of the forced matching number of graphs (Q4820537):
Displaying 25 items.
- 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)
- 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)
- 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)
- 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)
- The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes (Q2139808) (← links)
- On the spectrum of the perfect matching derangement graph (Q2159396) (← 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)
- Forcing and anti-forcing polynomials of a type of polyomino graphs (Q2687507) (← links)
- (Q4984549) (← links)
- (Q4984796) (← links)
- Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings (Q5091506) (← 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)
- Bounds and monotonicity of critical set parameters of colourings (Q6542052) (← links)
