Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree

DOI10.1007/978-3-642-40164-0_14zbMath1390.68341OpenAlexW1765158965MaRDI QIDQ2842779

Jiří Fiala, Pim van 't Hof, Daniël Paulusma, Steven Chaplick, Marek Tesař

Publication date: 16 August 2013

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/14180/1/14180.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Computational complexity of covering disconnected multigraphs ⋮ Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree

This page was built for publication: Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree