Definition 4.1 ([1]}) 

Let \(G = (V,E)\)  be a graph. A transition graph for a vertex \(v \in V\)  is a graph whose vertices are the edges incident to \(v\)  : \(T(v) =(\partial (v), E_v)\) . A transition system on \(G\)  is a family \(T =(T(v))_{v \in V}\)  of transition graphs. A graph equipped with a transition
system is called a graph with forbidden transitions.
