Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs

DOI10.1007/s10114-023-1020-6zbMath1521.05164arXiv2011.10172OpenAlexW3107561217MaRDI QIDQ6073878

Qian-qian Liu, Heping Zhang

Publication date: 18 September 2023

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

perfect matchingcomplete multipartite graphforcing spectrummaximum forcing numberminimum forcing number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• 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
• Uniquely forced perfect matching and unique 3-edge-coloring
• On forcing matching number of boron-nitrogen fullerene graphs
• Bounds on the forcing numbers of bipartite graphs
• Unimodularity of the Clar number problem
• The forcing number of toroidal polyhexes
• Forcing matching numbers of fullerene graphs
• Matching theory
• On n-extendable graphs
• The minimum forcing number for the torus and hypercube
• Forcing numbers of stop signs.
• Plane elementary bipartite graphs
• Forcing matchings on square grids
• The minimum forcing number of perfect matchings in the hypercube
• On the forced matching numbers of bipartite graphs
• Hexagonal systems with forcing edges
• Continuous forcing spectra of even polygonal chains
• Continuous forcing spectrum of regular hexagonal polyhexes
• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
• On the extendability of quasi-strongly regular graphs with diameter 2
• Characterizing the fullerene graphs with the minimum forcing number 3
• On the spectrum of the forced matching number of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item