Forcing matchings on square grids

DOI10.1016/S0012-365X(97)00266-5MaRDI QIDQ1584401zbMATH OpenFDO

Authors Lior Pachter, P. T. Kim

Publication date 2 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

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)

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

Cites work

• scientific article; zbMATH DE number 908792 (Why is no real title available?)
• A Minimax Theorem for Directed Graphs
• Centroids, Representations, and Submodular Flows
• Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
• Enumeration of perfect matchings in graphs with reflective symmetry
• Hexagonal systems with forcing edges
• Pick's Theorem
• Z-transformation graphs of perfect matchings of hexagonal systems

Cited in

(36)

• The forcing number of toroidal polyhexes
• Extremal anti-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
• Continuous forcing spectrum of regular hexagonal polyhexes
• A maximum resonant set of polyomino graphs
• Complete forcing numbers of \((4, 6)\)-fullerenes
• A minimax result for perfect matchings of a polyomino graph
• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
• Forcing matching numbers of fullerene graphs
• The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
• Bounds on the forcing numbers of bipartite graphs
• Matching forcing polynomials of constructable hexagonal systems
• Forcing and anti-forcing polynomials of a type of polyomino graphs
• Relations between global forcing number and maximum anti-forcing number of a graph
• Complete forcing numbers of catacondensed hexagonal systems
• The minimum forcing number for the torus and hypercube
• Continuous forcing spectra of even polygonal chains
• On the forced matching numbers of bipartite graphs
• Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
• The minimum forcing number of perfect matchings in the hypercube
• Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
• On the spectrum of the forced matching number of graphs
• The global forcing number of the parallelogram polyhex
• On the forcing matching numbers of prisms of graphs
• Global forcing number for maximal matchings
• Forcing numbers of stop signs.
• Complete forcing numbers of primitive coronoids
• On the anti-forcing number of benzenoids
• scientific article; zbMATH DE number 2152546 (Why is no real title available?)
• Anti-forcing spectra of perfect matchings of graphs
• Global forcing number of benzenoid graphs
• Maximum fractional forcing number of the powers of even cycles
• On forcing matching number of boron-nitrogen fullerene graphs
• Some novel minimax results for perfect matchings of hexagonal systems
• Anti-forcing numbers of perfect matchings of graphs

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)