On the global forcing number of hexagonal systems

DOI10.1016/j.dam.2013.08.020zbMath1300.05265OpenAlexW2080315417MaRDI QIDQ741758

Heping Zhang, Jinzhuan Cai

Publication date: 12 September 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.020

zbMATH Keywords

perfect matchinghexagonal systemglobal forcing numberdivisible hexagonal system

Mathematics Subject Classification ID

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

Related Items (6)

The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains ⋮ Complete forcing numbers of hexagonal systems. II ⋮ Complete forcing numbers of complete and almost-complete multipartite graphs ⋮ Complete forcing numbers of hexagonal systems ⋮ Relations between global forcing number and maximum anti-forcing number of a graph ⋮ Complete forcing numbers of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The global forcing number of the parallelogram polyhex
• Matching theory
• When each hexagon of a hexagonal system covers it
• A linear algorithm for perfect matching in hexagonal systems
• Global forcing number of benzenoid graphs
• Perfect matchings in hexagonal systems

This page was built for publication: On the global forcing number of hexagonal systems