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



: Hage J, Harju T, Welzl E

: 2002

Lecture Notes in Computer Science

GRAPH TRANSFORMATIONS, PROCEEDINGS

: LECT NOTES COMPUT SC

: 2505

: 148

: 160

: 13

: 3-540-44310-X

: 0302-9743


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.



Last updated on 2025-13-10 at 14:55