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

Anti-forcing numbers of perfect matchings of graphs, The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice, 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, Complete forcing numbers of catacondensed hexagonal systems, On the computational complexity of defining sets, Global forcing number of benzenoid 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