Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (Q1946734): Difference between revisions

@@ Property / author @@
-Micha Sharir
@@ Property / author: Micha Sharir / rank @@
-Normal rank
@@ Property / author @@
-Ermo Welzl
@@ Property / author: Ermo Welzl / rank @@
-Normal rank
@@ Property / author @@
+Micha Sharir
@@ Property / author: Micha Sharir / rank @@
+Normal rank
@@ Property / author @@
+Ermo Welzl
@@ Property / author: Ermo Welzl / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q54308610
@@ Property / Wikidata QID: Q54308610 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcta.2013.01.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2569928643
@@ Property / OpenAlex ID: W2569928643 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jct/SharirSW13
@@ Property / DBLP publication ID: journals/jct/SharirSW13 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1946734