Complete forcing numbers of hexagonal systems

DOI10.1007/s10910-021-01261-3zbMath1478.92262arXiv2009.04165OpenAlexW3168138701MaRDI QIDQ2046284

Yanyan Li

Publication date: 17 August 2021

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.04165

zbMATH Keywords

perfect matchinghexagonal systemcomplete forcing numbercomplete forcing setbenzenoid system

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Related Items (3)

Complete forcing numbers of hexagonal systems. II ⋮ Complete forcing numbers of complete and almost-complete multipartite graphs ⋮ Complete forcing numbers of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete forcing numbers of primitive coronoids
• The global forcing number of the parallelogram polyhex
• On the global forcing number of hexagonal systems
• A min-max result on outerplane bipartite graphs
• A min-max theorem for plane bipartite graphs
• Matching theory
• When each hexagon of a hexagonal system covers it
• Defining sets in vertex colorings of graphs and latin rectangles
• Plane elementary bipartite graphs
• The Clar covering polynomial of hexagonal systems. I
• Complete forcing numbers of catacondensed hexagonal systems
• Global forcing number of benzenoid graphs
• Complete Forcing Numbers of Polyphenyl Systems
• Perfect matchings in hexagonal systems
• Perfect matchings in hexagonal systems

This page was built for publication: Complete forcing numbers of hexagonal systems