Computing the bipartite edge frustration of fullerene graphs (Q2370428): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On some structural properties of fullerene graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On conjectures of Graffiti / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138921 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The independence numbers of fullerenes and benzenoids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4869540 / rank | |||
Normal rank |
Latest revision as of 09:35, 26 June 2024
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
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