On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
Journal of Combinatorial Theory Series B
Circular chromatic number: a survey
Discrete Mathematics
Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
SIAM Journal on Discrete Mathematics
A complete complexity classification of the role assignment problem
Theoretical Computer Science - Graph colorings
Exact Algorithms for Graph Homomorphisms
Theory of Computing Systems
On the computational complexity of partial covers of Theta graphs
Discrete Applied Mathematics
Complexity of Partial Covers of Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Set Partitioning via Inclusion-Exclusion
SIAM Journal on Computing
Exact Algorithms for L(2,1)-Labeling of Graphs
Algorithmica
On the complexity of exact algorithm for L (2, 1)-labeling of graphs
Information Processing Letters
Locally injective graph homomorphism: lists guarantee dichotomy
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Locally constrained graph homomorphisms-structure, complexity, and applications
Computer Science Review
Fast exact algorithm for L(2,1)-labeling of graphs
Theoretical Computer Science
| Hi-index | 0.89 |
For graphs G and H, a homomorphism from G to H is a function @f:V(G)-V(H), which maps vertices adjacent in G to adjacent vertices of H. A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H. Many cases of graph homomorphism and locally injective graph homomorphism are NP-complete, so there is little hope to design polynomial-time algorithms for them. In this paper we present an algorithm for graph homomorphism and locally injective homomorphism working in time O^@?((b+2)^|^V^(^G^)^|), where b is the bandwidth of the complement of H.