For graph classes P1, . . . ,Pk, Generalized Graph Coloring is the problem of deciding whether the vertex set of a given graph G can be partitioned into subsets V1, . . . , Vk so that Vj induces a graph in the class Pj (j = 1, 2, . . . , k). If P1 = · · · = Pk is the class of edgeless graphs, then this problem coincides with the standard vertex k-colorability, which is known to be NP-complete f...

We present a binary graph classifier (BGC) which allows to classify large, unweighted, undirected graphs. This classifier is based on a local decomposition of the graph for each node in generalized trees. The obtained trees, forming the tree set of the graph, are then pairwise compared by a generalized treesimilarity-algorithm (GTSA) and the resulting similarity scores determine a characteristi...