Computing the bipartite edge frustration of fullerene graphs (Q2370428): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.12.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074908910 / rank | |||
Normal rank | |||
Revision as of 01:56, 20 March 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
