A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs

Authors:
Jurriaan Hage;Tero Harju
Affiliations:
-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2005

Citing 0
Cited 2

On Switching to H-Free Graphs

ICGT '08 Proceedings of the 4th international conference on Graph Transformations
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

We characterize the switching classes that do not contain an acyclic graph. The characterization is by means of a set of forbidden induced subgraphs. We prove that in addition to switches of the cycles Cn for $n\geq 7$, there are only finitely many such graphs in 24 switching classes, all having at most 9 vertices. We give a representative of each of the 24 switching classes.