Forcing matching numbers of fullerene graphs
DOI10.1016/J.DAM.2009.10.013zbMATH Open1215.05139OpenAlexW1988475301MaRDI QIDQ968177FDOQ968177
Authors: B. E. Eshmatov 
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
Recommendations
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)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Plane elementary bipartite graphs
- Forcing matchings on square grids
- The minimum forcing number for the torus and hypercube
- Forcing numbers of stop signs.
- 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
- Hexagonal systems with forcing single edges
- The forcing number of toroidal polyhexes
- Title not available (Why is that?)
- Bounds on the forcing numbers of bipartite graphs
- Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
- On cyclic edge-connectivity of fullerenes
- The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
- Title not available (Why is that?)
- New lower bound on the number of perfect matchings in fullerene graphs
- A note on the cyclical edge-connectivity of fullerene graphs
Cited In (30)
- The forcing edge covering number of a graph
- Title not available (Why is that?)
- Fullerene graphs with exponentially many perfect matchings
- Anti-forcing number of some specific graphs
- The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice
- On the anti-Kekulé problem of cubic graphs
- Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
- On forcing matching number of boron-nitrogen fullerene graphs
- Forcing and anti-forcing numbers of (3,6)-fullerenes
- Continuous forcing spectra of even polygonal chains
- On lower bounds of number of perfect matchings in fullerene graphs
- Complete forcing numbers of \((4, 6)\)-fullerenes
- A mathematical programming model for computing the fries number of a fullerene
- Forcing numbers of stop signs.
- Characterizing the fullerene graphs with the minimum forcing number 3
- Uniquely forced perfect matching and unique 3-edge-coloring
- Complete forcing numbers of primitive coronoids
- Forcing and anti-forcing edges in bipartite graphs
- Fullerenes with the maximum Clar number
- Title not available (Why is that?)
- Distance-restricted matching extendability of fullerene graphs
- Complete forcing numbers of catacondensed hexagonal systems
- Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs
- Forcing and anti-forcing polynomials of a type of polyomino graphs
- 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
- Anti-forcing numbers of perfect matchings of graphs
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
- On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes
This page was built for publication: Forcing matching numbers of fullerene graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968177)
