On the spectrum of the forced matching number of graphs
From MaRDI portal
Publication:4820537
zbMath1056.05110arXiv0903.2578MaRDI QIDQ4820537
Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian
Publication date: 15 October 2004
Full work available at URL: https://arxiv.org/abs/0903.2578
Related Items (20)
A minimax result for perfect matchings of a polyomino graph ⋮ The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice ⋮ Continuous forcing spectrum of regular hexagonal polyhexes ⋮ The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes ⋮ Complete forcing numbers of primitive coronoids ⋮ On the computational complexity of defining sets ⋮ On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes ⋮ Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs ⋮ Global forcing number for maximal matchings ⋮ Anti-forcing spectrum of any cata-condensed hexagonal system is continuous ⋮ Forcing and anti-forcing polynomials of a type of polyomino graphs ⋮ On forcing matching number of boron-nitrogen fullerene graphs ⋮ Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids ⋮ Anti-forcing spectra of perfect matchings of graphs ⋮ Extremal anti-forcing numbers of perfect matchings of graphs ⋮ Forcing matching numbers of fullerene graphs ⋮ Continuous forcing spectra of even polygonal chains ⋮ Anti-forcing numbers of perfect matchings of graphs ⋮ Some tight bounds on the minimum and maximum forcing numbers of graphs ⋮ Complete forcing numbers of catacondensed hexagonal systems
This page was built for publication: On the spectrum of the forced matching number of graphs
