Forcing numbers of stop signs.

DOI10.1016/S0304-3975(02)00499-1zbMath1053.68070MaRDI QIDQ1401374

Fumei Lam, Lior Pachter

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

perfect matching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice ⋮ Complete forcing numbers of primitive coronoids ⋮ On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes ⋮ Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs ⋮ Anti-forcing spectrum of any cata-condensed hexagonal system is continuous ⋮ On forcing matching number of boron-nitrogen fullerene graphs ⋮ The forcing number of toroidal polyhexes ⋮ Forcing matching numbers of fullerene graphs ⋮ The global forcing number of the parallelogram polyhex ⋮ Continuous forcing spectra of even polygonal chains ⋮ On the forced matching numbers of bipartite graphs ⋮ Complete forcing numbers of catacondensed hexagonal systems ⋮ Bounds on the forcing numbers of bipartite graphs

Cites Work

• The minimum forcing number for the torus and hypercube
• Forcing matchings on square grids

This page was built for publication: Forcing numbers of stop signs.