A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Euler graphs, triangle-free graphs and bipartite graphs in switching classes
Tekijät: Hage J, Harju T, Emo W
Kustantaja: IOS PRESS
Julkaisuvuosi: 2003
Lehti:: Fundamenta Informaticae
Tietokannassa oleva lehden nimi: FUNDAMENTA INFORMATICAE
Lehden akronyymi: FUND INFORM
Vuosikerta: 58
Numero: 1
Aloitussivu: 23
Lopetussivu: 37
Sivujen määrä: 15
ISSN: 0169-2968
Tiivistelmä
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.
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.