On the forced matching numbers of bipartite graphs
From MaRDI portal
Publication:1827691
DOI10.1016/j.disc.2002.10.002zbMath1042.05076OpenAlexW2155190380MaRDI QIDQ1827691
Mohammad Mahdian, Ebadollah S. Mahmoodian, Peter J. Adams
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2002.10.002
Related Items (28)
The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice ⋮ The forcing edge covering number of a graph ⋮ Matching Forcing Polynomials of Constructable Hexagonal Systems ⋮ Continuous forcing spectrum of regular hexagonal polyhexes ⋮ Uniquely forced perfect matching and unique 3-edge-coloring ⋮ Complete forcing numbers of primitive coronoids ⋮ On the computational complexity of defining sets ⋮ Global forcing number of benzenoid graphs ⋮ Some novel minimax results for perfect matchings of hexagonal systems ⋮ Global forcing number for maximal matchings in corona products ⋮ 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 ⋮ The minimum forcing number of perfect matchings in the hypercube ⋮ Forcing polynomials of benzenoid parallelogram and its related benzenoids ⋮ The forcing number of toroidal polyhexes ⋮ Anti-forcing spectra of perfect matchings of graphs ⋮ Extremal anti-forcing numbers of perfect matchings of graphs ⋮ Forcing matching numbers of fullerene graphs ⋮ The global forcing number of the parallelogram polyhex ⋮ 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
Cites Work
- The minimum forcing number for the torus and hypercube
- Defining sets in vertex colorings of graphs and latin rectangles
- Forcing numbers of stop signs.
- Forcing matchings on square grids
- On the minimum number of blocks defining a design
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the forced matching numbers of bipartite graphs
