At most \(k\)-to-1 mappings between graphs. II

DOI10.1016/0012-365X(94)00341-FzbMath0851.05077MaRDI QIDQ1918542

Anthony J. W. Hilton, Jo W. Heath

Publication date: 21 November 1996

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

zbMATH Keywords

adjacency matrixmappings between graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Graphs that admit 3-to-1 or 2-to-1 maps onto the circle ⋮ Continuous \(k\)-to-\(1\) functions between complete graphs of even order

Cites Work

• Unnamed Item
• Unnamed Item
• k-to-1 functions on (0,1)
• The non-existence of a certain type of continuous transformation
• Two-to-one transformations
• n-to-one mappings of linear graphs
• k-to-1 Functions on an Arc
• k-To-1 Functions on Arcs for k Even
• k-to-1 Functions Between Graphs with Finitely Many Discontinuities
• Concerning Exactly (n, 1) Images of Continua
• Exactly k-To-1 Maps Between Graphs
• Trees that admit 3‐to‐1 maps onto the circle
• Paths, Trees, and Flowers
• Exactly (k,1) Transformations on Connected Linear Graphs
• On 𝑘-to-1 transformations
• A Short Proof of the Factor Theorem for Finite Graphs

This page was built for publication: At most \(k\)-to-1 mappings between graphs. II