Hexagonal systems with forcing edges
From MaRDI portal
Publication:1893176
DOI10.1016/0012-365X(93)E0184-6zbMath0832.05090OpenAlexW2090003163MaRDI QIDQ1893176
Publication date: 20 February 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0184-6
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (29)
The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice ⋮ Matching Forcing Polynomials of Constructable Hexagonal Systems ⋮ Decomposition theorem on matchable distributive lattices ⋮ Uniquely forced perfect matching and unique 3-edge-coloring ⋮ Global forcing number of benzenoid graphs ⋮ Some novel minimax results for perfect matchings of hexagonal systems ⋮ Single coronoid systems with an anti-forcing edge ⋮ Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs ⋮ Global forcing number for maximal matchings ⋮ Forcing faces in plane bipartite graphs ⋮ On forcing matching number of boron-nitrogen fullerene graphs ⋮ \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs ⋮ Forcing polynomials of benzenoid parallelogram and its related benzenoids ⋮ The forcing number of toroidal polyhexes ⋮ On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids ⋮ Hexagonal systems with forcing single edges ⋮ On the anti-forcing number of benzenoids ⋮ 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 ⋮ Continuous forcing spectra of even polygonal chains ⋮ Anti-forcing numbers of perfect matchings of graphs ⋮ Anti-forcing polynomials for benzenoid systems with forcing edges ⋮ The enumeration of several classes of hexagonal systems ⋮ The graph of perfect matching polytope and an extreme problem ⋮ Plane elementary bipartite graphs ⋮ Forcing matchings on square grids
Cites Work
This page was built for publication: Hexagonal systems with forcing edges