An upper bound for the Clar number of fullerene graphs (Q1025749): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4511016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2714987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-resonance of open-ended carbon nanotubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999755 / rank
 
Normal rank

Latest revision as of 17:23, 1 July 2024

scientific article
Language Label Description Also known as
English
An upper bound for the Clar number of fullerene graphs
scientific article

    Statements

    An upper bound for the Clar number of fullerene graphs (English)
    0 references
    0 references
    0 references
    23 June 2009
    0 references
    fullerene graph
    0 references
    carbon nanotube
    0 references
    Clar number
    0 references
    sextet pattern
    0 references
    Clar formula
    0 references
    perfect matching
    0 references
    Kekulé structure
    0 references

    Identifiers