Exactly k-To-1 Maps Between Graphs
From MaRDI portal
Publication:4018465
Recommendations
Cited in
(10)- Continuous \(k\)-to-\(1\) functions between complete graphs of even order
- Continuous \(k\)-to-1 functions between complete graphs whose orders are of a different parity
- At most k-to-1 mappings between graphs. II
- Constant-to-one and onto global maps of homomorphisms between strongly connected graphs
- Graphs that admit 3-to-1 or 2-to-1 maps onto the circle
- Wiggles and finitely discontinuous \(k\)-to-1 functions between graphs
- k-to-1 Functions Between Graphs with Finitely Many Discontinuities
- scientific article; zbMATH DE number 1792641 (Why is no real title available?)
- scientific article; zbMATH DE number 4177111 (Why is no real title available?)
- scientific article; zbMATH DE number 599717 (Why is no real title available?)
This page was built for publication: Exactly k-To-1 Maps Between Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018465)