Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems

Abstract

A transition in a graph is defined as a pair of adjacent edges. A transition system of an Eulerian graph refers to a set of partitions such that for each vertex of the graph, there corresponds to a partition of the set of edges incident to the vertex into transitions. A generalized transition system F(G) over a graph G defines a set of transitions over G. A compatible Eulerian circuit of an Eulerian graph G with a generalized transition system F(G) is defined as an Eulerian circuit in which no two consecutive edges form a transition defined by F(G). In this paper, we further introduce the concept of weakly generalized transition system which is an extension of the generalized transition system and prove some Ore-type sufficient conditions for the existence of compatible Eulerian circuits in Eulerian graphs with (weakly) generalized transition systems and obtain corresponding results for Eulerian digraphs. Our conditions improve some previous results due to Jackson and Isaak, respectively.