Finite common coverings of graphs (Q1165857): Difference between revisions

@@ Property / author @@
-Frank Thompson Leighton
@@ Property / author: Frank Thompson Leighton / rank @@
-Normal rank
@@ Property / author @@
+Frank Thompson Leighton
@@ Property / author: Frank Thompson Leighton / 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/0095-8956(82)90042-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2077744016
@@ Property / OpenAlex ID: W2077744016 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite common coverings of pairs of regular graphs
+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