On the forced matching numbers of bipartite graphs

DOI10.1016/j.disc.2002.10.002zbMath1042.05076MaRDI 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

zbMATH Keywords

Hypercubes; Forcing number; Matching in graphs; Unique matchings

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Matching Forcing Polynomials of Constructable Hexagonal Systems, Anti-forcing numbers of perfect matchings of graphs, Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs, 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, Complete forcing numbers of primitive coronoids, Anti-forcing spectra of perfect matchings of graphs, Extremal anti-forcing numbers of perfect matchings of graphs, On forcing matching number of boron-nitrogen fullerene graphs, The global forcing number of the parallelogram polyhex, The forcing number of toroidal polyhexes, Forcing matching numbers of fullerene graphs, Global forcing number for maximal matchings, Anti-forcing spectrum of any cata-condensed hexagonal system is continuous, 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, Continuous forcing spectra of even polygonal chains, Some tight bounds on the minimum and maximum forcing numbers of graphs, Continuous forcing spectrum of regular hexagonal polyhexes, Some novel minimax results for perfect matchings of hexagonal systems, Global forcing number for maximal matchings in corona products, Complete forcing numbers of catacondensed hexagonal systems, On the computational complexity of defining sets, On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes, Global forcing number of benzenoid graphs, Forcing and anti-forcing polynomials of a type of polyomino graphs, The forcing edge covering number of a graph

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