On the Computational Complexity of Codes in Graphs

Authors:
Jan Kratochvíl;Mirko Krivánek
Affiliations:
-;-
Venue:
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Year:
1988

Citing 0
Cited 3

Generalized domination in chordal graphs

Nordic Journal of Computing
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
A generalization of Lee codes

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract