The global forcing number of the parallelogram polyhex

DOI10.1016/j.dam.2012.05.021zbMath1252.05180OpenAlexW1964052051MaRDI QIDQ713327

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

zbMATH Keywords

global forcing setglobal forcing numberparallelogram polyhex

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

Complete forcing numbers of hexagonal systems. II ⋮ Global forcing number for maximal matchings in corona products ⋮ Complete forcing numbers of complete and almost-complete multipartite graphs ⋮ Global forcing number for maximal matchings ⋮ Forcing polynomials of benzenoid parallelogram and its related benzenoids ⋮ On the global forcing number of hexagonal systems ⋮ Complete forcing numbers of hexagonal systems ⋮ Relations between global forcing number and maximum anti-forcing number of a graph ⋮ Complete forcing numbers of catacondensed hexagonal systems ⋮ Complete forcing numbers of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hexagonal systems with forcing single edges
• Bounds on the forcing numbers of bipartite graphs
• The forcing number of toroidal polyhexes
• Matching theory
• The minimum forcing number for the torus and hypercube
• Forcing numbers of stop signs.
• Plane elementary bipartite graphs
• Forcing matchings on square grids
• On the forced matching numbers of bipartite graphs
• Resonance in elemental benzenoids
• Global forcing number of benzenoid graphs

This page was built for publication: The global forcing number of the parallelogram polyhex