Forcing matchings on square grids

DOI10.1016/S0012-365X(97)00266-5zbMATH Open0956.05087MaRDI QIDQ1584401FDOQ1584401

Lior Pachter, P. T. Kim

Publication date: 2 November 2000

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

Recommendations

• On the spectrum of the forced matching number of graphs
• Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
• Bounds on the forcing numbers of bipartite graphs
• On the forced matching numbers of bipartite graphs
• The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice

zbMATH Keywords

domino tilingperfect matchingforcing numberminimum feedback set problem

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Enumeration of perfect matchings in graphs with reflective symmetry
• Z-transformation graphs of perfect matchings of hexagonal systems
• Hexagonal systems with forcing edges
• A Minimax Theorem for Directed Graphs
• Centroids, Representations, and Submodular Flows
• Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
• Pick's Theorem
• Title not available (Why is that?)

Cited In (36)

• On the spectrum of the forced matching number of graphs
• A maximum resonant set of polyomino graphs
• 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
• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
• The global forcing number of the parallelogram polyhex
• On forcing matching number of boron-nitrogen fullerene graphs
• On the anti-forcing number of benzenoids
• Continuous forcing spectra of even polygonal chains
• Matching Forcing Polynomials of Constructable Hexagonal Systems
• The forcing number of toroidal polyhexes
• Forcing matching numbers of fullerene graphs
• Continuous forcing spectrum of regular hexagonal polyhexes
• Complete forcing numbers of \((4, 6)\)-fullerenes
• The minimum forcing number for the torus and hypercube
• Forcing numbers of stop signs.
• Title not available (Why is that?)
• Complete forcing numbers of primitive coronoids
• On the forced matching numbers of bipartite graphs
• The minimum forcing number of perfect matchings in the hypercube
• Some novel minimax results for perfect matchings of hexagonal systems
• Bounds on the forcing numbers of bipartite graphs
• Global forcing number of benzenoid graphs
• Maximum fractional forcing number of the powers of even cycles
• Complete forcing numbers of catacondensed hexagonal systems
• Forcing and anti-forcing polynomials of a type of polyomino graphs
• On the forcing matching numbers of prisms of graphs
• Relations between global forcing number and maximum anti-forcing number of a graph
• Anti-forcing spectra of perfect matchings of graphs
• Extremal anti-forcing numbers of perfect matchings of graphs
• Anti-forcing numbers of perfect matchings of graphs
• Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
• Some tight bounds on the minimum and maximum forcing numbers of graphs
• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
• Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
• Global forcing number for maximal matchings

This page was built for publication: Forcing matchings on square grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584401)