Hexagonal systems with forcing single edges
From MaRDI portal
Publication:674445
Recommendations
Cites work
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 4189780 (Why is no real title available?)
- Hexagonal systems with forcing edges
- Matching theory
- When each hexagon of a hexagonal system covers it
- Z-transformation graphs of perfect matchings of hexagonal systems
Cited in
(21)- Extremal anti-forcing numbers of perfect matchings of graphs
- Continuous forcing spectrum of regular hexagonal polyhexes
- Plane elementary bipartite graphs with forcing or anti-forcing edges
- Forcing matching numbers of fullerene graphs
- The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
- Matching forcing polynomials of constructable hexagonal systems
- Anti-forcing polynomials for benzenoid systems with forcing edges
- Forcing and anti-forcing polynomials of a type of polyomino graphs
- Forcing and anti-forcing edges in bipartite graphs
- The polyomino graphs whose resonance graphs have a 1-degree vertex
- Relations between global forcing number and maximum anti-forcing number of a graph
- Forcing hexagons in hexagonal systems
- The global forcing number of the parallelogram polyhex
- The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes
- Matching anti-forcing polynomials of catacondensed hexagonal systems
- Anti-forcing spectra of perfect matchings of graphs
- On forcing matching number of boron-nitrogen fullerene graphs
- Hexagonal systems with forcing edges
- Single coronoid systems with an anti-forcing edge
- Some novel minimax results for perfect matchings of hexagonal systems
- Anti-forcing numbers of perfect matchings of graphs
This page was built for publication: Hexagonal systems with forcing single edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674445)