An algorithm for the number of path homomorphisms
From MaRDI portal
Recommendations
- A note on counting homomorphisms of paths
- An algorithm for the numbers of endomorphisms on paths (DM13208)
- On computing the path number of a graph
- The number of path homomorphisms by the generalized Catalan number
- An algorithm for computing homology groups
- Path homomorphisms
- scientific article; zbMATH DE number 1545676
- Counting graph homomorphisms
- Fundamentals of Computation Theory
- Exact algorithms for graph homomorphisms
Cites work
- An algorithm for the numbers of endomorphisms on paths (DM13208)
- scientific article; zbMATH DE number 1047891 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- Postscript: ``Endomorphism spectra of graphs [Discrete Mathematics 109 (1992) 45--57]
Cited in
(14)- Homomorphisms to oriented paths
- A note on counting homomorphisms of paths
- Edge \(k\)-to-1 homomorphisms
- The cardinality of endomorphisms on some oriented paths: an algorithm
- Finding the number of cycle egamorphisms
- The number of path homomorphisms by the generalized Catalan number
- On the number of congruence classes of paths
- Betti numbers of order-preserving graph homomorphisms
- Graph homomorphisms between trees
- Distinguishing graphs by the number of homomorphisms
- scientific article; zbMATH DE number 841621 (Why is no real title available?)
- scientific article; zbMATH DE number 7450713 (Why is no real title available?)
- Homomorphisms of trees into a path
- An algorithm for the numbers of endomorphisms on paths (DM13208)
This page was built for publication: An algorithm for the number of path homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045039)
