Hexagonal systems with forcing edges
From MaRDI portal
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)
Recommendations
- Hexagonal systems with forcing single edges
- Forcing hexagons in hexagonal systems
- Complete forcing numbers of hexagonal systems
- Maximum forcing number of hexagonal systems
- On the global forcing number of hexagonal systems
- scientific article; zbMATH DE number 3961637
- The forcing polynomial of catacondensed hexagonal systems
- Matching forcing polynomials of constructable hexagonal systems
- scientific article; zbMATH DE number 6749523
- Complete forcing numbers of hexagonal systems. II
Cites work
- scientific article; zbMATH DE number 4065046 (Why is no real title available?)
- scientific article; zbMATH DE number 4065047 (Why is no real title available?)
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 4189780 (Why is no real title available?)
- Forcing bonds of a benzenoid system
- The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
- Z-transformation graphs of perfect matchings of hexagonal systems
Cited in
(33)- Forcing polynomials of benzenoid parallelogram and its related benzenoids
- Global forcing number for maximal matchings
- Anti-forcing polynomials for benzenoid systems with forcing edges
- On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
- The graph of perfect matching polytope and an extreme problem
- Forcing faces in plane bipartite graphs
- Decomposition theorem on matchable distributive lattices
- Plane elementary bipartite graphs with forcing or anti-forcing edges
- The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
- scientific article; zbMATH DE number 6749523 (Why is no real title available?)
- The polyomino graphs whose resonance graphs have a 1-degree vertex
- The enumeration of several classes of hexagonal systems
- On forcing matching number of boron-nitrogen fullerene graphs
- Hexagonal systems with forcing single edges
- On the anti-forcing number of benzenoids
- Continuous forcing spectra of even polygonal chains
- The forcing number of toroidal polyhexes
- Forcing matching numbers of fullerene graphs
- Plane elementary bipartite graphs
- Forcing matchings on square grids
- Uniquely forced perfect matching and unique 3-edge-coloring
- Forcing and anti-forcing edges in bipartite graphs
- Some novel minimax results for perfect matchings of hexagonal systems
- Global forcing number of benzenoid graphs
- Forcing hexagons in hexagonal systems
- Matching forcing polynomials of constructable hexagonal systems
- Single coronoid systems with an anti-forcing edge
- Anti-forcing spectra of perfect matchings of graphs
- Extremal anti-forcing numbers of perfect matchings of graphs
- Z-transformation graphs of perfect matchings of plane bipartite graphs
- Forcing faces in plane bipartite graphs. II
- Anti-forcing numbers of perfect matchings of graphs
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
This page was built for publication: Hexagonal systems with forcing edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893176)