scientific article; zbMATH DE number 6274836
From MaRDI portal
Publication:5403515
Vertex degrees (05C07) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90)
Recommendations
- scientific article; zbMATH DE number 6282162
- Number of matchings of low order in (4,6)-Fullerene graphs
- On the number of matchings and independent sets in \((3,6)\)-fullerenes
- Closed formulas for the number of small paths, independent sets and matchings in fullerenes
- On lower bounds of number of perfect matchings in fullerene graphs
- New lower bound on the number of perfect matchings in fullerene graphs
- Matchings in m-generalized fullerene graphs
- Asymptotic enumeration of perfect matchings in \(m\)-barrel fullerene graphs
- On the maximum forcing and anti-forcing numbers of (4, 6)-fullerenes
- Forcing matching numbers of fullerene graphs
Cited in
(7)- Distance-restricted matching extendability of fullerene graphs
- On the maximum forcing and anti-forcing numbers of (4, 6)-fullerenes
- Number of matchings of low order in (4,6)-Fullerene graphs
- Computing the number of matchings in catacondensed benzenoid systems
- scientific article; zbMATH DE number 6282162 (Why is no real title available?)
- On the number of matchings and independent sets in \((3,6)\)-fullerenes
- Closed formulas for the number of small paths, independent sets and matchings in fullerenes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403515)
