Comparing universal covers in polynomial time
From MaRDI portal
Publication:987372
Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- Comparing Universal Covers in Polynomial Time
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- scientific article; zbMATH DE number 2081019
- Locally constrained graph homomorphisms and equitable partitions
Cites work
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 91031 (Why is no real title available?)
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1107736 (Why is no real title available?)
- scientific article; zbMATH DE number 2080268 (Why is no real title available?)
- scientific article; zbMATH DE number 2081019 (Why is no real title available?)
- scientific article; zbMATH DE number 3005477 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 2111730 (Why is no real title available?)
- A complete complexity classification of the role assignment problem
- Automata, Languages and Programming
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms
- Comparing Universal Covers in Polynomial Time
- Computing Boolean functions on anonymous networks
- Constructing 5-Arc-Transitive Cubic Graphs
- Covering regular graphs
- Faster Subtree Isomorphism
- Finite common coverings of pairs of regular graphs
- Fixed-parameter complexity of \(\lambda\)-labelings
- Graph theory with applications
- Homomorphisms of derivative graphs
- How hard is it to determine if a graph has a 2-role assignment?
- Local computations in graphs: the case of cellular edge local computations
- Locally constrained graph homomorphisms and equitable partitions
- Partial covers of graphs
- Role colouring a graph
- The role assignment model nearly fits most social networks
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
Cited in
(13)- Comparing Universal Covers in Polynomial Time
- Computing role assignments of proper interval graphs in polynomial time
- An algorithmic framework for locally constrained homomorphisms
- Computing role assignments of split graphs
- Computing role assignments of proper interval graphs in polynomial time
- Graph-Theoretic Concepts in Computer Science
- Computing role assignments of chordal graphs
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- scientific article; zbMATH DE number 5849947 (Why is no real title available?)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms
- An algorithmic framework for locally constrained homomorphisms
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- Graphs with prescribed local neighborhoods of their universal coverings
This page was built for publication: Comparing universal covers in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987372)
