Fullerene graphs have exponentially many perfect matchings (Q839387): Difference between revisions

@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+Perfect matchings in planar cubic graphs
@@ Property / cites work: Perfect matchings in planar cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On lower bounds of number of perfect matchings in fullerene graphs
+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 @@
+Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages
+Normal rank
@@ Property / cites work @@
+Fullerene graphs with exponentially many perfect matchings
+Normal rank
@@ Property / cites work @@
+Leapfrog fullerenes have many perfect matchings
@@ Property / cites work: Leapfrog fullerenes have many perfect matchings / rank @@
+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 @@
+The four-colour theorem
@@ Property / cites work: The four-colour theorem / rank @@
+Normal rank
@@ Property / cites work @@
+New lower bound on the number of perfect matchings in fullerene graphs
+Normal rank