Computing the bipartite edge frustration of fullerene graphs (Q2370428)

From MaRDI portal
Revision as of 17:18, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing the bipartite edge frustration of fullerene graphs
scientific article

    Statements

    Computing the bipartite edge frustration of fullerene graphs (English)
    0 references
    0 references
    0 references
    26 June 2007
    0 references
    bipartite edge frustration
    0 references
    fullerene graph
    0 references
    icosahedral fullerene
    0 references
    fullerene stability
    0 references
    bipartite spanning subgraph
    0 references

    Identifiers