On bicriticality of (3,6)-fullerene graphs
From MaRDI portal
Publication:1734896
Recommendations
Cites work
- 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes
- A class of Hamiltonian polytopes
- Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes
- Computing the bipartite edge frustration of fullerene graphs
- Cyclical edge-connectivity of fullerene graphs and (k,6)-cages
- Forcing and anti-forcing numbers of (3,6)-fullerenes
- Graph Factors and Matching Extensions
- Graph theory
- Hexagonal resonance of (3,6)-fullerenes
- scientific article; zbMATH DE number 1522751 (Why is no real title available?)
- Matching theory
- New lower bound on the number of perfect matchings in fullerene graphs
- On lower bounds of number of perfect matchings in fullerene graphs
- On some structural properties of fullerene graphs
- On the number of matchings and independent sets in \((3,6)\)-fullerenes
- Spectra of toroidal graphs
- The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
Cited in
(4)
This page was built for publication: On bicriticality of (3,6)-fullerene graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734896)