Combinatorial $n$-od covers of graphs

Logan C. Hoehn, Hugo Adrian Maldonado-Garcia

We introduce the notion of a combinatorial $n$-od cover, for $n\ge 3$, which is a tool that may be used to show that certain continua embedded in the plane are not simple $n$-od-…