Euler graphs, triangle-free graphs and bipartite graphs in switching classes

: Hage J, Harju T, Emo W

Publisher: IOS PRESS

: 2003

Fundamenta Informaticae

FUNDAMENTA INFORMATICAE

: FUND INFORM

: 58

: 1

: 23

: 37

: 15

: 0169-2968

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.

Mathematics