We characterize these graphs which admit exactly (n,1) mappings onto themselves. We also suggest two questions concerning the subject.
Cited in
(7)- Exactly (n,1) mappings onto generalized local dendrites
- Graphs that admit 3-to-1 or 2-to-1 maps onto the circle
- About graph mappings
- Constant-to-one and onto global maps of homomorphisms between strongly connected graphs
- A note on enumeration of one-vertex maps
- scientific article; zbMATH DE number 3906544 (Why is no real title available?)
- scientific article; zbMATH DE number 1792641 (Why is no real title available?)
This page was built for publication: Exactly (n,1) mappings on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093202)