An algorithm for the number of path homomorphisms

DOI10.1016/J.DISC.2008.04.010zbMath1182.05116OpenAlexW2016524155MaRDI QIDQ1045039

Piotr Wojtylak, Srichan Arworn

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.010

zbMATH Keywords

graphgraph homomorphismundirected path

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

On the number of congruence classes of paths ⋮ A note on counting homomorphisms of paths ⋮ Unnamed Item ⋮ Graph homomorphisms between trees

Cites Work

• An algorithm for the numbers of endomorphisms on paths (DM13208)
• Postscript: ``Endomorphism spectra of graphs [Discrete Mathematics 109 (1992) 45--57]
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for the number of path homomorphisms