How to find a common subgraph using igraph

Given the two plots, how can I find the subplots in these two plots that are isomorphic. Currently, I just found that igraph implemented igraph_subisomorphic_vf2, which has two plots G and H as inputs and determines if G contains a subgraph that is isomorphic to H.

Since I haven't found any other function in igraph that can directly solve my problem, currently I think one way is to list all possible subgraphs from a given graph and then use the igraph_subisomorphic_vf2 function to determine if the subgraph is isomorphic to another set schedule.

For the plots in my dataset, the average number of nodes is 40. I wonder if this is a possible way to solve the problem?

Is there a better way to find the maximum subgraph in given two or more graphs?

Thank!