A1 Refereed original research article in a scientific journal
Euler graphs, triangle-free graphs and bipartite graphs in switching classes
Authors: Hage J, Harju T, Emo W
Publisher: IOS PRESS
Publication year: 2003
Journal:: Fundamenta Informaticae
Journal name in source: FUNDAMENTA INFORMATICAE
Journal acronym: FUND INFORM
Volume: 58
Issue: 1
First page : 23
Last page: 37
Number of pages: 15
ISSN: 0169-2968
Abstract
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.
UTU Research Portal