Topological graph theory
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Coverings and minors: application to local computations in graphs
European Journal of Combinatorics
Journal of Combinatorial Theory Series B
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Complexity of Graph Covering Problems
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
Complexity of Colored Graph Covers I. Colored Directed Multigraphs
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Approximating the domatic number
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Generalized H-Coloring of Graphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Complexity of Partial Covers of Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Fixed-Parameter Complexity of lambda-Labelings
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Generalized H-Coloring and H-Covering of Trees
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Generalized H-coloring and H-covering of trees
Nordic Journal of Computing
Energy conservation via domatic partitions
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Cantor-Bernstein type theorem for locally constrained graph homomorphisms
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
On the computational complexity of partial covers of Theta graphs
Discrete Applied Mathematics
Block transitivity and degree matrices
European Journal of Combinatorics
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Complexity of locally injective homomorphism to the theta graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Locally injective homomorphism to the simple weight graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Graph labelings derived from models in distributed computing
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Packing bipartite graphs with covers of complete bipartite graphs
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
On the complexity of planar covering of small graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Locally constrained graph homomorphisms-structure, complexity, and applications
Computer Science Review
Packing bipartite graphs with covers of complete bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
For a fixed graph H, the H-cover problem asks whether an input graph G allows a degree preserving mapping f : V(G) → V(H) such that for every υ ∈ V(G), f(NG(υ)) = NH(f(υ)). In this paper we design efficient algorithms for certain graph covering problems according to two basic techniques. The first is based in part on a reduction to the 2-SAT problem. The second technique exploits necessary and sufficient conditions for the partition of a graph into 1-factors and 2-factors. For other infinite classes of graph covering problems we derive NP- completeness results by reductions from graph coloring problems. We illustrate this methodology by classifying the complexity of all H-cover problems defined by simple graphs H with at most 6 vertices.