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

Authors:
Jurriaan Hage;Tero Harju;Emo Welzl
Affiliations:
-;-;-
Venue:
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Year:
2002

Citing 3
Cited 4

Topological graph theory

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

Journal of Combinatorial Theory Series B - 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

Fundamenta Informaticae - Special issue on the first international conference on graph transformation (ICGT 2002)
On Switching to H-Free Graphs

ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Switching to hedgehog-free graphs is NP-complete

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes

Fundamenta Informaticae - The First International Conference on Graph Transformation (ICGT 2002)

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.