Complexity of planar signed graph homomorphisms to cycles

DOI10.1016/j.dam.2020.03.029zbMath1443.05084arXiv1907.03266MaRDI QIDQ777377

Pascal Ochem, Florent Foucaud, François Dross, Valia Mitsou, Théo Pierron

Publication date: 7 July 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.03266

zbMATH Keywords

graph homomorphism; signed graph; planar graph; edge-coloured graph

Mathematics Subject Classification ID

05C38: Paths and cycles

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

05C22: Signed and weighted graphs