Computational complexity of covering regular trees
From MaRDI portal
Cites work
- 3-connected reduction for regular graph covers
- A complete complexity classification of the role assignment problem
- Algorithmic aspects of regular graph covers with applications to planar graphs
- An Efficient Algorithm for Graph Isomorphism
- Antipodal covering graphs
- Automorphisms of graphs and coverings
- Complexity of graph covering problems
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
- Computational complexity of covering cyclic graphs
- Computational complexity of covering disconnected multigraphs
- Computational complexity of covering three-vertex multigraphs
- Constructing 5-Arc-Transitive Cubic Graphs
- Covering regular graphs
- Coverings and minors: Application to local computations in graphs
- Elementary abelian covers of graphs
- Finite common coverings of graphs
- Finite common coverings of pairs of regular graphs
- Graph labelings derived from models in distributed computing: A complete complexity classification
- Harmonic morphisms of graphs. Part I: Graph coverings
- Homological Coverings of Graphs
- scientific article; zbMATH DE number 4106877 (Why is no real title available?)
- scientific article; zbMATH DE number 3735856 (Why is no real title available?)
- scientific article; zbMATH DE number 91031 (Why is no real title available?)
- scientific article; zbMATH DE number 512941 (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 3005477 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- scientific article; zbMATH DE number 2111730 (Why is no real title available?)
- scientific article; zbMATH DE number 7724194 (Why is no real title available?)
- K4,4 ?e has no finite planar cover
- Labelling Graphs with a Condition at Distance 2
- Lifting graph automorphisms by voltage assignments
- List covering of regular multigraphs
- List covering of regular multigraphs with semi-edges
- Local computations in graphs: the case of cellular edge local computations
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
- Modular operads
- NP completeness of finding the chromatic index of regular graphs
- On possible counterexamples to Negami's planar cover conjecture
- On the complexity of H-coloring
- On the complexity of planar covering of small graphs
- Packing bipartite graphs with covers of complete bipartite graphs
- Partial covers of graphs
- Regular embeddings of canonical double coverings of graphs
- Revisiting Leighton’s theorem with the Haar measure
- SOFSEM 2005: Theory and Practice of Computer Science
- The complexity of locally injective homomorphisms
- Two graphs without planar covers
This page was built for publication: Computational complexity of covering regular trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310188)
