Hexagonal systems with forcing single edges
From MaRDI portal
Publication:674445
DOI10.1016/0166-218X(95)00116-9zbMath0865.05069OpenAlexW2052939479MaRDI QIDQ674445
Publication date: 5 March 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (18)
The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice ⋮ Matching Forcing Polynomials of Constructable Hexagonal Systems ⋮ Continuous forcing spectrum of regular hexagonal polyhexes ⋮ The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes ⋮ Some novel minimax results for perfect matchings of hexagonal systems ⋮ Single coronoid systems with an anti-forcing edge ⋮ Matching anti-forcing polynomials of catacondensed hexagonal systems ⋮ Forcing and anti-forcing polynomials of a type of polyomino graphs ⋮ On forcing matching number of boron-nitrogen fullerene graphs ⋮ Anti-forcing spectra of perfect matchings of graphs ⋮ Forcing and anti-forcing edges in bipartite graphs ⋮ Extremal anti-forcing numbers of perfect matchings of graphs ⋮ Plane elementary bipartite graphs with forcing or anti-forcing edges ⋮ Forcing matching numbers of fullerene graphs ⋮ The global forcing number of the parallelogram polyhex ⋮ Anti-forcing numbers of perfect matchings of graphs ⋮ Anti-forcing polynomials for benzenoid systems with forcing edges ⋮ Relations between global forcing number and maximum anti-forcing number of a graph
Cites Work
This page was built for publication: Hexagonal systems with forcing single edges
