Computing the bipartite edge frustration of fullerene graphs (Q2370428): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2006.12.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2074908910
@@ Property / OpenAlex ID: W2074908910 / rank @@
+Normal rank
@@ Property / cites work @@
+On some structural properties of fullerene graphs
@@ Property / cites work: On some structural properties of fullerene graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On conjectures of Graffiti
@@ Property / cites work: On conjectures of Graffiti / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank
@@ Property / cites work @@
+The independence numbers of fullerenes and benzenoids
+Normal rank
@@ Property / cites work @@
+The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank