When working on a special kind of graph, a researcher often wants to know if some literature already exists on that topic. Indeed, it is not easy to search for some literature on a given family of graph without knowing its name, which is likely a reason why some families of graphs are already known with various names. To handle this problem, we propose a tool that could be used to find the name(s) of a graph given its description.
Because there are a lot of graphs, it would have been hard to characterize them all at the same time. For that reason, we started to characterize one special kind of graph first, which is the tree. The lobster, the caterpillar and the spider are a few families of trees. In this talk, those families and some other ones will be presented and characterized.