Comparing universal covers in polynomial time (Q987372): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2087073372
@@ Property / OpenAlex ID: W2087073372 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4017175
@@ Property / cites work: Q4017175 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite common coverings of pairs of regular graphs
+Normal rank
@@ Property / cites work @@
+Q4770409
@@ Property / cites work: Q4770409 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing 5-Arc-Transitive Cubic Graphs
@@ Property / cites work: Constructing 5-Arc-Transitive Cubic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3416074
@@ Property / cites work: Q3416074 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Role colouring a graph
@@ Property / cites work: Role colouring a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474120
@@ Property / cites work: Q4474120 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial covers of graphs
@@ Property / cites work: Partial covers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Cantor--Bernstein type theorem for locally constrained graph homomorphisms
+Normal rank
@@ Property / cites work @@
+A complete complexity classification of the role assignment problem
+Normal rank
@@ Property / cites work @@
+Comparing Universal Covers in Polynomial Time
@@ Property / cites work: Comparing Universal Covers in Polynomial Time / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter complexity of \(\lambda\)-labelings
+Normal rank
@@ Property / cites work @@
+Q4825539
@@ Property / cites work: Q4825539 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Locally constrained graph homomorphisms and equitable partitions
+Normal rank
@@ Property / cites work @@
+Q3137758
@@ Property / cites work: Q3137758 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3236252
@@ Property / cites work: Q3236252 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Boolean functions on anonymous networks
@@ Property / cites work: Computing Boolean functions on anonymous networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4373685
@@ Property / cites work: Q4373685 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering regular graphs
@@ Property / cites work: Covering regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472519
@@ Property / cites work: Q4472519 / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphisms of derivative graphs
@@ Property / cites work: Homomorphisms of derivative graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
+Normal rank
@@ Property / cites work @@
+The role assignment model nearly fits most social networks
+Normal rank
@@ Property / cites work @@
+Q4481981
@@ Property / cites work: Q4481981 / rank @@
+Normal rank
@@ Property / cites work @@
+How hard is it to determine if a graph has a 2-role assignment?
+Normal rank
@@ Property / cites work @@
+Q4065581
@@ Property / cites work: Q4065581 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Subtree Isomorphism
@@ Property / cites work: Faster Subtree Isomorphism / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:987372