Clar sets and maximum forcing numbers of hexagonal systems
From MaRDI portal
Recommendations
Cited in
(19)- The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials
- Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
- Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
- The Clar covering polynomial of hexagonal systems. III
- Relations between global forcing number and maximum anti-forcing number of a graph
- Some novel minimax results for perfect matchings of hexagonal systems
- Clar structures vs Fries structures in hexagonal systems
- A minimax result for perfect matchings of a polyomino graph
- Matching forcing polynomials of constructable hexagonal systems
- scientific article; zbMATH DE number 6749543 (Why is no real title available?)
- Maximum forcing number of hexagonal systems
- scientific article; zbMATH DE number 5030034 (Why is no real title available?)
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
- Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
- Perfect matchings of (4, 6)-fullerenes with largest forcing number
- On the global forcing number of hexagonal systems
- Hypergraphs and the Clar problem in hexagonal systems
- Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system
- Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems
This page was built for publication: Clar sets and maximum forcing numbers of hexagonal systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5279137)
