Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes

Authors:
Jurriaan Hage;Tero Harju;Emo Welzl
Affiliations:
Institute of Information and Computing Science, Universiteit Utrecht, P.O.Box 80.089, 3508 TB Utrecht, Netherlands;Department of Mathematics, University of Turku, FIN-20014 Turku, Finland;Institut füur Theoretische Informatik, ETH Zürich, CH - 8092 Zürich, Switzerland
Venue:
Fundamenta Informaticae - The First International Conference on Graph Transformation (ICGT 2002)
Year:
2003

Citing 5
Cited 1

Topological graph theory

Topological graph theory
Biased graphs. I. Bias, balance, and gains

Journal of Combinatorial Theory Series B - Series B
Recognizing P3-structure: a switching approach

Journal of Combinatorial Theory Series B
Complexity Issues in Switching of Graphs

TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes

ICGT '02 Proceedings of the First International Conference on Graph Transformation

Subgroup Switching of Skew Gain Graphs

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the context of graph transformations we look at the operation of switching, which can be viewed as a 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, Hage, Harju and Rozenberg 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.