Complexity of locally injective homomorphism to the theta graphs

Authors:
Bernard Lidický;Marek Tesař
Affiliations:
Department of Applied Mathematics, Charles University, Prague, Czech Republic;Department of Applied Mathematics, Charles University, Prague, Czech Republic
Venue:
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Year:
2010

Citing 11
Cited 1

The classification of coverings of processor networks

Journal of Parallel and Distributed Computing
On the complexity of H-coloring

Journal of Combinatorial Theory Series B
Covering regular graphs

Journal of Combinatorial Theory Series B
Complexity of graph covering problems

Nordic Journal of Computing
Generalized H-Coloring of Graphs

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Complexity of Colored Graph Covers I. Colored Directed Multigraphs

WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
On the computational complexity of partial covers of Theta graphs

Discrete Applied Mathematics
NP completeness of the edge precoloring extension problem on bipartite graphs

Journal of Graph Theory
Complexity of Partial Covers of Graphs

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
The computational complexity of the role assignment problem

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Locally injective graph homomorphism: lists guarantee dichotomy

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science

Locally injective homomorphism to the simple weight graphs

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Theta graph is a multigraph which is a union of at least three internally disjoint paths that have the same two distinct end vertices. In this extended abstract we show full computational complexity characterization of the problem of deciding the existence of a locally injective homomorphism from an input graph G to any fixed Theta graph.