In the context of graph transformations we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of graphs through local transformations of the vertices. A switching class is then a set of graphs obtainable from a given start graph by applying the switching operation. Continuing the line of research in Ehrenfeucht et al. we consider the problem of detecting three kinds of graphs in switching classes. For all three we find algorithms running in time polynomial in the number of vertices in the graphs, although switching classes contain exponentially many graphs.
CITATION STYLE
Hage, J., Harju, T., & Welzl, E. (2002). Euler graphs, triangle-free graphs and bipartite graphs in switching classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2505, pp. 148–160). Springer Verlag. https://doi.org/10.1007/3-540-45832-8_13
Mendeley helps you to discover research relevant for your work.