Comparing Universal Covers in Polynomial Time
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Comparing universal covers in polynomial time
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
- Covering regular graphs
- Algorithmic aspects of regular graph covers with applications to planar graphs
Cites work
- A complete complexity classification of the role assignment problem
- Computing Boolean functions on anonymous networks
- Constructing 5-Arc-Transitive Cubic Graphs
- Covering regular graphs
- Finite common coverings of 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?
- 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 2080268 (Why is no real title available?)
- scientific article; zbMATH DE number 2081019 (Why is no real title available?)
- scientific article; zbMATH DE number 2111730 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 3246034 (Why is no real title available?)
- 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
- Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
Cited in
(7)- 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?)
- Universal covers, color refinement, and two-variable counting logic: lower bounds for the depth
- Unfoldings and Coverings of Weighted Graphs
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms
- On the complexity of role colouring planar graphs, trees and cographs
- Comparing universal covers in polynomial time
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 Q3503635)
