The global forcing number of the parallelogram polyhex
From MaRDI portal
Publication:713327
DOI10.1016/J.DAM.2012.05.021zbMATH Open1252.05180OpenAlexW1964052051MaRDI QIDQ713327FDOQ713327
Authors: Jelena Sedlar 
Publication date: 26 October 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.05.021
Recommendations
Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Matching theory
- Plane elementary bipartite graphs
- Forcing matchings on square grids
- The minimum forcing number for the torus and hypercube
- Forcing numbers of stop signs.
- On the forced matching numbers of bipartite graphs
- Resonance in elemental benzenoids
- Title not available (Why is that?)
- Hexagonal systems with forcing single edges
- The forcing number of toroidal polyhexes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bounds on the forcing numbers of bipartite graphs
- Global forcing number of benzenoid graphs
Cited In (12)
- Complete forcing numbers of complete and almost-complete multipartite graphs
- On the global forcing number of hexagonal systems
- Complete forcing numbers of graphs
- Global forcing number for maximal matchings in corona products
- Global forcing number of benzenoid graphs
- Complete forcing numbers of catacondensed hexagonal systems
- Complete forcing numbers of hexagonal systems
- Complete forcing numbers of hexagonal systems. II
- Relations between global forcing number and maximum anti-forcing number of a graph
- Global forcing number of some chemical graphs
- Forcing polynomials of benzenoid parallelogram and its related benzenoids
- Global forcing number for maximal matchings
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)
