In the literature, graphs are often studied in terms of invariants, for instance the number of vertices or edges, the stability number, the chromatic number ... However, it is common to study Graph Theory not only through invariants but also using subgraphs. Nevertheless, both concepts may be used together. Perfect graphs and cographs are two well-known examples of such line of study. In this paper, we present a computer software dedicated to the study of graphs and their induced subgraphs.
Published February 2016 , 11 pages
G1610.pdf (400 KB)