To Homepage of Tero Harju

Graph Theory


Books (with information on the web)

General Links and tutorials

Open Problems

Combinatorics Sites

More Graph Theory Sites

Some of my Articles on Switching

  • Andrzej Ehrenfeucht, Tero Harju, and Grzegorz Rozenberg
    Transitivity of local complementation and switching on graphs ps.gz
    Discrete Math. 278 (2004), 45 - 60.
    doi: 10.1016/j.disc.2003.04.001

    Transitivity of complementation, local complementation and switching are considered for undirected graphs. Simple compositions of these operations are shown to form transitive groups. Also, most impressively, it is shown that complementation is a composition of 13 operations of local complementation and switching.

  • Jurriaan Hage and Tero Harju
    A characterization of acyclic switching classes using forbidden subgraphs pdf
    SIAM J. Discrete Math. 18(1) (2004), 159 - 176.
    doi: 10.1137/S0895480100381890

    We characterize by forbidden subgraphs the switching classes of graphs that do not contain an acyclic graph. In addition to switches of the cycles C(n) for n > 6, there are only finitely many such graphs in 24 switching classes, all having at most 9 vertices.

  • Andrzej Ehrenfeucht, Tero Harju, and Grzegorz Rozenberg:
    Finite metrics in switching classes
    An older version: pdf
    Discrete Appl. Math., 155 (2007), 68-73.