Combinatorial $n$-od covers of graphs
We introduce the notion of a combinatorial $n$-od cover, for $n \geq 3$, which is a tool that may be used to show that certain continua embedded in the plane are not simple $n$-od-like. Using this tool, we generalize a classic example of Ingram, and give a construction, for each $n \geq 3$, of an indecomposable plane continuum which is simple $(n+1)$-od-like but not simple $n$-od-like, and such that each non-degenerate proper subcontinuum is an arc. These examples may be compared with related constructions of Kennaugh [10].
math.GN↗