Bipartizing fullerenes (Q427819): Difference between revisions

@@ Property / author @@
-Riste Škrekovski
@@ Property / author: Riste Škrekovski / rank @@
-Normal rank
@@ Property / author @@
-Bernard Lidický
@@ Property / author: Bernard Lidický / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2914210329
@@ Property / OpenAlex ID: W2914210329 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0420
@@ Property / arXiv ID: 1106.0420 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the bipartite edge frustration of fullerene graphs
+Normal rank
@@ Property / cites work @@
+Q5753988
@@ Property / cites work: Q5753988 / rank @@
+Normal rank
@@ Property / cites work @@
+Fullerene graphs have exponentially many perfect matchings
+Normal rank
@@ Property / cites work @@
+Cyclic edge-cuts in fullerene graphs
@@ Property / cites work: Cyclic edge-cuts in fullerene graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4511036
@@ Property / cites work: Q4511036 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:427819