On the complexity of a hypermap (Q1173096): Difference between revisions

@@ Property / author @@
-Antonio Machì
@@ Property / author: Antonio Machì / rank @@
-Normal rank
@@ Property / author @@
+Antonio Machì
@@ Property / author: Antonio Machì / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4770409
@@ Property / cites work: Q4770409 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees of dual graphs
@@ Property / cites work: Spanning trees of dual graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4071773
@@ Property / cites work: Q4071773 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3206970
@@ Property / cites work: Q3206970 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3921249
@@ Property / cites work: Q3921249 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of A Planar Hypermap And That of Its Dual
+Normal rank
@@ Property / cites work @@
+Q5578800
@@ Property / cites work: Q5578800 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4065567
@@ Property / cites work: Q4065567 / rank @@
+Normal rank