List covering of regular multigraphs with semi-edges

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Locally constrained graph homomorphisms -- structure, complexity, and applications
Elementary abelian covers of graphs
A complete complexity classification of the role assignment problem
Computational complexity of covering three-vertex multigraphs
On the complexity of H-coloring
Finite common coverings of graphs
Generating all graph coverings by permutation voltage assignments
Covering regular graphs
Automorphisms of graphs and coverings
Lifting graph automorphisms by voltage assignments
3-connected reduction for regular graph covers
Regular embeddings of canonical double coverings of graphs
List homomorphisms and circular arc graphs
Computational complexity of covering disconnected multigraphs
List covering of regular multigraphs
Subexponential algorithms for variants of the homomorphism problem in string graphs
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
On the computational complexity of partial covers of theta graphs
Antipodal covering graphs
Complexity of Locally Injective Homomorphism to the Theta Graphs
Locally Injective Homomorphism to the Simple Weight Graphs
On the Complexity of Planar Covering of Small Graphs
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
Labelling Graphs with a Condition at Distance 2
Modular operads
NP completeness of the edge precoloring extension problem on bipartite graphs
Complexity of locally-injective homomorphisms to tournaments
Partial covers of graphs
Revisiting Leighton’s theorem with the Haar measure
Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs

This page was built for publication: List covering of regular multigraphs with semi-edges