Finding Vertex-Surjective Graph Homomorphisms
From MaRDI portal
Publication:2907498
DOI10.1007/978-3-642-30642-6_16zbMath1360.68511arXiv1204.2124OpenAlexW4232709711MaRDI QIDQ2907498
Barnaby Martin, Bernard Lidický, Daniël Paulusma, Petr A. Golovach
Publication date: 10 September 2012
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.2124
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
The complexity of surjective homomorphism problems-a survey ⋮ Computing vertex-surjective homomorphisms to partially reflexive trees