scientific article; zbMATH DE number 6750326
From MaRDI portal
Publication:5280018
zbMATH Open1461.05226MaRDI QIDQ5280018FDOQ5280018
Authors:
Publication date: 19 July 2017
Title of this publication is not available (Why is that?)
Recommendations
- A mathematical programming model for computing the fries number of a fullerene
- scientific article; zbMATH DE number 6704624
- Fullerenes with the maximum Clar number
- An upper bound for the Clar number of fullerene graphs
- Extremal fullerene graphs with the maximum Clar number
- Sharp upper bounds on the Clar number of fullerene graphs
- Counting clar structures of \((4,6)\)-fullerenes
- The clar number of fullerene C\(_{24n}\) and carbon nanocone CNC\(_4[n]\)
- Backtracking to compute the closed-shell independence number of a fullerene
- Computing the permanental polynomial of the high level fullerene \(C_{70}\) with high precision
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cited In (9)
- On the Clar number of graphene fragment
- Spectral clustering of combinatorial fullerene isomers based on their facet graph structure
- Title not available (Why is that?)
- The fullerene graphs with a perfect star packing
- A mathematical programming model for computing the fries number of a fullerene
- A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\)
- Counting clar structures of \((4,6)\)-fullerenes
- Title not available (Why is that?)
- The complexity of the Clar number problem and an exact algorithm
Uses Software
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 Q5280018)
