Finite common coverings of pairs of regular graphs (Q1135865): Difference between revisions

@@ Property / cites work @@
+Q4770409
@@ Property / cites work: Q4770409 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3856805
@@ Property / cites work: Q3856805 / rank @@
+Normal rank
@@ Property / cites work @@
+Antipodal Embeddings of Graphs
@@ Property / cites work: Antipodal Embeddings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Kronecker Products and Local Joins of Graphs
@@ Property / cites work: Kronecker Products and Local Joins of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Antipodal covering graphs
@@ Property / cites work: Antipodal covering graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Every connected regular graph of even degree is a Schreier coset graph
+Normal rank
@@ Property / cites work @@
+Generating all graph coverings by permutation voltage assignments
+Normal rank
@@ Property / cites work @@
+Q5534009
@@ Property / cites work: Q5534009 / rank @@
+Normal rank
@@ Property / cites work @@
+Double covers of graphs
@@ Property / cites work: Double covers of graphs / rank @@
+Normal rank