Forcing matching numbers of fullerene graphs
From MaRDI portal
Publication:968177
DOI10.1016/j.dam.2009.10.013zbMath1215.05139OpenAlexW1988475301MaRDI QIDQ968177
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.10.013
Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (22)
The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice ⋮ The forcing edge covering number of a graph ⋮ Uniquely forced perfect matching and unique 3-edge-coloring ⋮ Complete forcing numbers of primitive coronoids ⋮ Characterizing the fullerene graphs with the minimum forcing number 3 ⋮ Single coronoid systems with an anti-forcing edge ⋮ On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes ⋮ Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs ⋮ Anti-forcing spectrum of any cata-condensed hexagonal system is continuous ⋮ Forcing and anti-forcing polynomials of a type of polyomino graphs ⋮ Distance-restricted matching extendability of fullerene graphs ⋮ On forcing matching number of boron-nitrogen fullerene graphs ⋮ Anti-forcing spectra of perfect matchings of graphs ⋮ Forcing and anti-forcing edges in bipartite graphs ⋮ Extremal anti-forcing numbers of perfect matchings of graphs ⋮ Continuous forcing spectra of even polygonal chains ⋮ On the anti-Kekulé problem of cubic graphs ⋮ A mathematical programming model for computing the fries number of a fullerene ⋮ Fullerenes with the maximum Clar number ⋮ Anti-forcing numbers of perfect matchings of graphs ⋮ Anti-forcing number of some specific graphs ⋮ Complete forcing numbers of catacondensed hexagonal systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hexagonal systems with forcing single edges
- Bounds on the forcing numbers of bipartite graphs
- A note on the cyclical edge-connectivity of fullerene graphs
- The forcing number of toroidal polyhexes
- On cyclic edge-connectivity of fullerenes
- The minimum forcing number for the torus and hypercube
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- Forcing numbers of stop signs.
- Plane elementary bipartite graphs
- Forcing matchings on square grids
- New lower bound on the number of perfect matchings in fullerene graphs
- On the forced matching numbers of bipartite graphs
- Hexagonal systems with forcing edges
- Forcing bonds of a benzenoid system
- On the spectrum of the forced matching number of graphs
- The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
This page was built for publication: Forcing matching numbers of fullerene graphs
