- check the relation between graph classes and get a witness for the result
- draw clear inclusion diagrams
- colour these diagrams according to the complexity of selected problems
- find the P/NP boundary for a problem
- save your diagrams as Postscript, GraphML or SVG files
- find references on classes, inclusions and algorithms

Clique

Clique cover

Cliquewidth

Cliquewidth expression

Colourability

Cutwidth

Domination

Feedback vertex set

Graph isomorphism

Hamiltonian cycle

Hamiltonian path

Independent set

Maximum cut

Recognition

Treewidth

Weighted clique

Weighted feedback vertex set

Weighted independent set