Some tight bounds on the minimum and maximum forcing numbers of graphs

DOI10.1016/j.dam.2022.09.014zbMath1503.05097arXiv2106.09209OpenAlexW4306169284MaRDI QIDQ2097177

Qian-qian Liu, Heping Zhang

Publication date: 11 November 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.09209

zbMATH Keywords

bipartite graphperfect matchingmaximum forcing numberminimum forcing number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• A maximum resonant set of polyomino graphs
• The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
• Extremal anti-forcing numbers of perfect matchings of graphs
• Bounds on the forcing numbers of bipartite graphs
• Unimodularity of the Clar number problem
• The forcing number of toroidal polyhexes
• Matching theory
• On minimal elementary bipartite graphs
• The minimum forcing number for the torus and hypercube
• Forcing matchings on square grids
• The minimum forcing number of perfect matchings in the hypercube
• On some graphs with a unique perfect matching
• On the forced matching numbers of bipartite graphs
• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
• On the anti-forcing number of benzenoids
• Tight upper bound on the maximum anti-forcing numbers of graphs
• On the spectrum of the forced matching number of graphs
• On the structure of factorizable graphs
• Anti-forcing numbers of perfect matchings of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some tight bounds on the minimum and maximum forcing numbers of graphs