Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)

Cites Work

Modular operads
Title not available (Why is that?)
Lifting graph automorphisms by voltage assignments
Title not available (Why is that?)
Elementary abelian covers of graphs
Coverings and minors: Application to local computations in graphs
Local computations in graphs: the case of cellular edge local computations
Title not available (Why is that?)
Harmonic morphisms of graphs. Part I: Graph coverings
Locally constrained graph homomorphisms -- structure, complexity, and applications
Regular embeddings of canonical double coverings of graphs
An Efficient Algorithm for Graph Isomorphism
Title not available (Why is that?)
Covering regular graphs
Title not available (Why is that?)
Constructing 5-Arc-Transitive Cubic Graphs
SOFSEM 2005: Theory and Practice of Computer Science
Title not available (Why is that?)
Homological Coverings of Graphs
Complexity of hypergraph coloring and Seidel's switching.
Complexity of graph covering problems
Algorithmic aspects of regular graph covers with applications to planar graphs
Computational complexity of covering three-vertex multigraphs
Compatible 2-factors
Graph labelings derived from models in distributed computing: A complete complexity classification
On the complexity of planar covering of small graphs
Computational complexity of covering disconnected multigraphs
List covering of regular multigraphs
Title not available (Why is that?)
Locally injective homomorphism to the simple weight graphs
Title not available (Why is that?)

Cited In (1)

Computational complexity of covering disconnected multigraphs

This page was built for publication: Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496545)