Complexity dichotomy for oriented homomorphism of planar graphs with large girth

From MaRDI portal
Publication:2355705

DOI10.1016/j.tcs.2015.06.041zbMath1328.68092OpenAlexW830674616MaRDI QIDQ2355705

Guillaume Guégan, Pascal Ochem

Publication date: 24 July 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.041




Related Items (4)




Cites Work




This page was built for publication: Complexity dichotomy for oriented homomorphism of planar graphs with large girth