Global forcing number of benzenoid graphs

DOI10.1007/s10910-006-9056-2zbMath1122.05089MaRDI QIDQ2644398

Tomislav Došlić

Publication date: 31 August 2007

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

Full work available at URL: https://doi.org/10.1007/s10910-006-9056-2

zbMATH Keywords

perfect matching; global forcing number; benzenoid graph

Mathematics Subject Classification ID

05C90: Applications of graph theory

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

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

Related Items

Complete forcing numbers of graphs, Complete forcing numbers of complete and almost-complete multipartite graphs, On the existence of multiply connected monolayered cyclofusenes with given parameters, On forcing matching number of boron-nitrogen fullerene graphs, The global forcing number of the parallelogram polyhex, On the global forcing number of hexagonal systems, The graph of perfect matching polytope and an extreme problem, Global forcing number for maximal matchings, Continuous forcing spectra of even polygonal chains, Complete forcing numbers of hexagonal systems, Relations between global forcing number and maximum anti-forcing number of a graph, The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes, Complete forcing numbers of hexagonal systems. II, Complete forcing numbers of catacondensed hexagonal systems

Cites Work

• Unnamed Item
• On lower bounds of number of perfect matchings in fullerene graphs
• The minimum forcing number for the torus and hypercube
• Forcing matchings on square grids
• On the forced matching numbers of bipartite graphs
• Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs
• Hexagonal systems with forcing edges
• Perfect matchings in bipartite lattice animals: lower bounds and realizability