Complete forcing numbers of catacondensed hexagonal systems
From MaRDI portal
Publication:2344000
DOI10.1007/s10878-013-9624-xzbMath1321.90148OpenAlexW2034296984MaRDI QIDQ2344000
Heping Zhang, Shou-Jun Xu, Jinzhuan Cai
Publication date: 11 May 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9624-x
perfect matchingforcing numberKekulé structurecomplete forcing numberforcing setcatacondensed hexagonal systemglobal forcing number
Related Items (9)
The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains ⋮ Complete forcing numbers of hexagonal systems. II ⋮ Complete forcing numbers of primitive coronoids ⋮ Complete forcing numbers of complete and almost-complete multipartite graphs ⋮ The research and progress of the enumeration of lattice paths ⋮ Hexagonal systems with the one-to-one correspondence between geometric and algebraic Kekulé structures ⋮ Complete Forcing Numbers of Polyphenyl Systems ⋮ Complete forcing numbers of hexagonal systems ⋮ Complete forcing numbers of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exponentially many perfect matchings in cubic graphs
- The global forcing number of the parallelogram polyhex
- Bounds on the forcing numbers of bipartite graphs
- Forcing matching numbers of fullerene graphs
- The minimum forcing number for the torus and hypercube
- Defining sets in vertex colorings of graphs and latin rectangles
- Forcing numbers of stop signs.
- Plane elementary bipartite graphs
- Forcing matchings on square grids
- On the forced matching numbers of bipartite graphs
- Perfect matchings in planar cubic graphs
- Global forcing number of benzenoid graphs
- On the minimum number of blocks defining a design
- On the spectrum of the forced matching number of graphs
This page was built for publication: Complete forcing numbers of catacondensed hexagonal systems
