Complete forcing numbers of hexagonal systems. II

DOI10.1007/s10910-022-01330-1zbMath1492.92152OpenAlexW4213345420MaRDI QIDQ2143442

Yanyan Li

Publication date: 31 May 2022

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

Full work available at URL: https://doi.org/10.1007/s10910-022-01330-1

zbMATH Keywords

perfect matchingforcing numberhexagonal systemcomplete forcing number

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Related Items

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
• 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 theorem for plane bipartite graphs
• Matching theory
• When each hexagon of a hexagonal system covers it
• Plane elementary bipartite graphs
• Complete forcing numbers of hexagonal systems
• On the forcing matching numbers of prisms of graphs
• Complete forcing numbers of catacondensed hexagonal systems
• Global forcing number of benzenoid graphs
• Characterizing the fullerene graphs with the minimum forcing number 3
• Graph Factors and Matching Extensions
• Complete Forcing Numbers of Polyphenyl Systems
• Forcing and anti-forcing polynomials of perfect matchings of a pyrene system
• Perfect matchings in hexagonal systems
• Perfect matchings in hexagonal systems