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, Welzl E
Publication year: 2002
Journal:: Lecture Notes in Computer Science
Journal name in source: GRAPH TRANSFORMATIONS, PROCEEDINGS
Journal acronym: LECT NOTES COMPUT SC
Volume: 2505
First page : 148
Last page: 160
Number of pages: 13
ISBN: 3-540-44310-X
ISSN: 0302-9743
Abstract
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.
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.
UTU Research Portal