On the number of matchings and independent sets in (3,6)-fullerenes
From MaRDI portal
(Redirected from Publication:5408296)
On the number of matchings and independent sets in \((3,6)\)-fullerenes
On the number of matchings and independent sets in \((3,6)\)-fullerenes
Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) 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
Cited in
(14)- On bicriticality of (3,6)-fullerene graphs
- Restricted 2-extendability of (3,6)-fullerenes
- On the number of 5-matchings in boron-nitrogen fullerene graphs.
- Matchings in m-generalized fullerene graphs
- Distance under symmetry: (3,6)-fullerenes
- Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
- scientific article; zbMATH DE number 1549850 (Why is no real title available?)
- Zigzag Structures of Simple Two-Faced Polyhedra
- Number of matchings of low order in (4,6)-Fullerene graphs
- Computing the number of matchings in catacondensed benzenoid systems
- On the growth rate of the number of fullerenes
- scientific article; zbMATH DE number 6274836 (Why is no real title available?)
- scientific article; zbMATH DE number 6282162 (Why is no real title available?)
- Closed formulas for the number of small paths, independent sets and matchings in fullerenes
This page was built for publication: On the number of matchings and independent sets in \((3,6)\)-fullerenes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408296)
