Embedding in Switching Classes with Skew Gains

In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labelled) graphs through local transformations of the vertices.

[1]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[2]  Tero Harju,et al.  Structure and organization , 2014 .

[3]  Tero Harju,et al.  Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes , 2003, Fundam. Informaticae.

[4]  Thomas Zaslavsky,et al.  Biased graphs. I. Bias, balance, and gains , 1989, J. Comb. Theory, Ser. B.

[5]  Thomas Zaslavsky.  Signed graphs: To: T. Zaslausky, Discrete Appl. Math 4 (1982) 47-74 , 1983, Discret. Appl. Math..

[6]  Hartmut Ehrig,et al.  Refinements of Graph Transformation Systems via Rule Expressions , 2000 .

[7]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[8]  Thomas Zaslavsky.  Signed graphs , 1982, Discret. Appl. Math..

[9]  M. Hall.  The Theory Of Groups , 1959 .

[10]  Andrzej Ehrenfeucht,et al.  Dynamic labeled 2-structures , 1994, Mathematical Structures in Computer Science.

[11]  Tero Harju,et al.  Complexity Issues in Switching of Graphs , 1998, TAGT.

[12]  Jurriaan Hage.  The Membership Problem for Switching Classes with Skew Gains , 1999, Fundam. Informaticae.

[13]  Tero Harju,et al.  The Theory of 2-Structures - A Framework for Decomposition and Transformation of Graphs , 1997, Handbook of Graph Grammars.