Spanning trees, Euler tours, medial graphs, left-right paths and cycle spaces (Q804581): Difference between revisions

Let L be a graph embedded in a given surface. By the medial M of G the author means the graph whose vertices are the edges of G and each angle of a face of G produces an edge of M joining the two (possibly the same) edges forming the angle. The concept of a left-right path can be found in an earlier paper of the author and \textit{H. Shank} [Combinatorics, graph theory and computing, Proc. 15th Southeast. Conf., La. State Univ. 1984, Congr. Numerantium 45, 115-128 (1984; Zbl 0566.05026)]. In the paper under review the author shows that if a graph G embedded in the projective plane has only one left-right path then the number of spanning trees in G and its geometric dual have different parities and its medial has an odd number of noncrossing Euler tours.