Bounds on the forcing numbers of bipartite graphs
From MaRDI portal
Publication:817753
DOI10.1016/j.disc.2005.11.001zbMath1084.05050OpenAlexW1986535470MaRDI QIDQ817753
Publication date: 20 March 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.001
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (14)
Complete forcing numbers of primitive coronoids ⋮ On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes ⋮ Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs ⋮ Maximum fractional forcing number of the powers of even cycles ⋮ On forcing matching number of boron-nitrogen fullerene graphs ⋮ Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids ⋮ The forcing number of toroidal polyhexes ⋮ Forcing matching numbers of fullerene graphs ⋮ The global forcing number of the parallelogram polyhex ⋮ Continuous forcing spectra of even polygonal chains ⋮ The graph of perfect matching polytope and an extreme problem ⋮ Some tight bounds on the minimum and maximum forcing numbers of graphs ⋮ Divisibility of an eigenform by an eigenform ⋮ Complete forcing numbers of catacondensed hexagonal systems
Cites Work
This page was built for publication: Bounds on the forcing numbers of bipartite graphs
