The minimum forcing number for the torus and hypercube

DOI10.1016/S0012-365X(01)00228-XzbMath0990.05101MaRDI QIDQ1348133

Matthew E. Riddle

Publication date: 15 May 2002

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

zbMATH Keywords

hypercubegraphtorusperfect matchingforcing number

Mathematics Subject Classification ID

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

Related Items (34)

The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice ⋮ Matching Forcing Polynomials of Constructable Hexagonal Systems ⋮ 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 ⋮ The lower and upper forcing geodetic numbers of block--cactus 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 ⋮ Forcing polynomials of benzenoid parallelogram and its related benzenoids ⋮ The forcing number of toroidal polyhexes ⋮ 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 ⋮ The lower and upper forcing geodetic numbers of completen-partite graphs,n-dimensional meshes and tori ⋮ Anti-forcing numbers of perfect matchings of graphs ⋮ The \((a,b)\)-forcing geodetic graphs ⋮ The forcing hull and forcing geodetic numbers 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 ⋮ The graph of perfect matching polytope and an extreme problem ⋮ 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

This page was built for publication: The minimum forcing number for the torus and hypercube