Forcing matchings on square grids
From MaRDI portal
Publication:1584401
DOI10.1016/S0012-365X(97)00266-5zbMath0956.05087MaRDI QIDQ1584401
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items (32)
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 ⋮ Matching Forcing Polynomials of Constructable Hexagonal Systems ⋮ Continuous forcing spectrum of regular hexagonal polyhexes ⋮ Complete forcing numbers of primitive coronoids ⋮ Global forcing number of benzenoid graphs ⋮ Some novel minimax results for perfect matchings of hexagonal systems ⋮ On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes ⋮ Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs ⋮ Global forcing number for maximal matchings ⋮ Maximum fractional forcing number of the powers of even cycles ⋮ Anti-forcing spectrum of any cata-condensed hexagonal system is continuous ⋮ Forcing numbers of stop signs. ⋮ Forcing and anti-forcing polynomials of a type of polyomino graphs ⋮ On forcing matching number of boron-nitrogen fullerene graphs ⋮ Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids ⋮ The minimum forcing number of perfect matchings in the hypercube ⋮ The forcing number of toroidal polyhexes ⋮ On the anti-forcing number of benzenoids ⋮ Anti-forcing spectra of perfect matchings of graphs ⋮ Extremal anti-forcing numbers of perfect matchings of graphs ⋮ Forcing matching numbers of fullerene graphs ⋮ The global forcing number of the parallelogram polyhex ⋮ Continuous forcing spectra of even polygonal chains ⋮ Anti-forcing numbers of perfect matchings of graphs ⋮ On the forced matching numbers of bipartite graphs ⋮ On the forcing matching numbers of prisms of graphs ⋮ Relations between global forcing number and maximum anti-forcing number of a graph ⋮ Some tight bounds on the minimum and maximum forcing numbers of graphs ⋮ Complete forcing numbers of catacondensed hexagonal systems ⋮ Bounds on the forcing numbers of bipartite graphs
Cites Work
- Unnamed Item
- Z-transformation graphs of perfect matchings of hexagonal systems
- Hexagonal systems with forcing edges
- Pick's Theorem
- A Minimax Theorem for Directed Graphs
- Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs
- Centroids, Representations, and Submodular Flows
- Enumeration of perfect matchings in graphs with reflective symmetry
This page was built for publication: Forcing matchings on square grids
