The embedding problem for switching classes of graphs



: Ehrenfeucht A, Hage J, Harju T, Rozenberg G

Publisher: IOS PRESS

: 2006

Fundamenta Informaticae

FUNDAMENTA INFORMATICAE

: FUND INFORM

: 74

: 1

: 115

: 134

: 20

: 0169-2968


Although a number of our results hold specifically for undirected, unlabelled graphs, we propose a more general framework and give many positive and negative results for more general cases, where the graphs are labelled with elements of a (finitely generated abelian) group.



Last updated on 2025-14-10 at 09:56