The global forcing number of the parallelogram polyhex
From MaRDI portal
Publication:713327
Recommendations
Cites work
- scientific article; zbMATH DE number 4087719 (Why is no real title available?)
- scientific article; zbMATH DE number 2152546 (Why is no real title available?)
- scientific article; zbMATH DE number 5238980 (Why is no real title available?)
- Bounds on the forcing numbers of bipartite graphs
- Forcing matchings on square grids
- Forcing numbers of stop signs.
- Global forcing number of benzenoid graphs
- Hexagonal systems with forcing single edges
- Matching theory
- On the forced matching numbers of bipartite graphs
- Plane elementary bipartite graphs
- Resonance in elemental benzenoids
- The forcing number of toroidal polyhexes
- The minimum forcing number for the torus and hypercube
Cited in
(12)- On the global forcing number of hexagonal systems
- Global forcing number of some chemical graphs
- Relations between global forcing number and maximum anti-forcing number of a graph
- Complete forcing numbers of catacondensed hexagonal systems
- Complete forcing numbers of complete and almost-complete multipartite graphs
- Global forcing number for maximal matchings in corona products
- Complete forcing numbers of graphs
- Forcing polynomials of benzenoid parallelogram and its related benzenoids
- Complete forcing numbers of hexagonal systems. II
- Global forcing number for maximal matchings
- Global forcing number of benzenoid graphs
- Complete forcing numbers of hexagonal systems
This page was built for publication: The global forcing number of the parallelogram polyhex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713327)