Maximum forcing number of hexagonal systems
From MaRDI portal
Publication:5408293
zbMATH Open1299.05274MaRDI QIDQ5408293FDOQ5408293
Authors: Liqiong Xu, Hong Bian, Fuji Zhang 
Publication date: 9 April 2014
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (31)
- Anti-forcing polynomials for benzenoid systems with forcing edges
- Title not available (Why is that?)
- A maximum resonant set of polyomino graphs
- Title not available (Why is that?)
- A minimax result for perfect matchings of a polyomino graph
- The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
- Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
- The forcing number of toroidal polyhexes
- On the global forcing number of hexagonal systems
- Continuous forcing spectrum of regular hexagonal polyhexes
- Complete forcing numbers of \((4, 6)\)-fullerenes
- Title not available (Why is that?)
- Hexagonal systems with forcing edges
- Clar sets and maximum forcing numbers of hexagonal systems
- Some novel minimax results for perfect matchings of hexagonal systems
- The minimum forcing and anti-forcing numbers of convex hexagonal systems
- Removable and forced subgraphs of graphs
- Matching forcing polynomials of constructable hexagonal systems
- Complete forcing numbers of hexagonal systems
- Forcing and anti-forcing polynomials of a type of polyomino graphs
- Complete forcing numbers of hexagonal systems. II
- Relations between global forcing number and maximum anti-forcing number of a graph
- Anti-forcing spectra of perfect matchings of graphs
- The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes
- The maximum forcing number of a polyomino
- Anti-forcing numbers of perfect matchings of graphs
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
- Some tight bounds on the minimum and maximum forcing numbers of graphs
- On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
- Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
- Forcing polynomials of benzenoid parallelogram and its related benzenoids
This page was built for publication: Maximum forcing number of hexagonal systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408293)
