On bicriticality of (3,6)-fullerene graphs

DOI10.1007/s10910-018-0917-2zbMath1410.92177OpenAlexW2804995080WikidataQ129780356 ScholiaQ129780356MaRDI QIDQ1734896

Xianqiang Yang

Publication date: 27 March 2019

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-018-0917-2

zbMATH Keywords

perfect matchingresonant hexagonbicritical graph(3,6)-fullerene

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items

Nice pairs of odd cycles in fullerene graphs ⋮ Restricted 2-extendability of (3,6)-fullerenes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hexagonal resonance of (3,6)-fullerenes
• 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes
• Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes
• Spectra of toroidal graphs
• Matching theory
• On lower bounds of number of perfect matchings in fullerene graphs
• Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
• New lower bound on the number of perfect matchings in fullerene graphs
• On some structural properties of fullerene graphs
• Computing the bipartite edge frustration of fullerene graphs
• Graph Factors and Matching Extensions
• A class of Hamiltonian polytopes
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra