Graphs that admit 3-to-1 or 2-to-1 maps onto the circle

DOI10.1016/0166-218X(95)00041-OzbMath0851.05086MaRDI QIDQ1917280

Cheng Zhao, Anthony J. W. Hilton, Ji Ping Liu

Publication date: 24 November 1996

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

zbMATH Keywords

treecirclecontinuous mapsunicyclic graph

Mathematics Subject Classification ID

Trees (05C05) Special maps on topological spaces (open, closed, perfect, etc.) (54C10) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Related Items (1)

Wiggles and Finitely Discontinuousk-to-1 Functions Between Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exactly (n,1) mappings on graphs
• At most \(k\)-to-1 mappings between graphs. II
• The non-existence of a certain type of continuous transformation
• n-to-one mappings of linear graphs
• The existence ofk-to-1 continuous maps between graphs whenk is sufficiently large
• k-To-1 Functions on Arcs for k Even
• There is no Exactly k-to-1 Function from any Continuum onto [0, 1, or any Dendrite, with only Finitely Many Discontinuities]
• 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
• Exactly (k,1) Transformations on Connected Linear Graphs
• Research problems

This page was built for publication: Graphs that admit 3-to-1 or 2-to-1 maps onto the circle