- 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

booleanwidth decomposition

Clique

Clique cover

cliquewidth decomposition

Colourability

cutwidth decomposition

Domination

Feedback vertex set

Graph isomorphism

Hamiltonian cycle

Hamiltonian path

Independent set

Maximum cut

Monopolarity

Polarity

Recognition

treewidth decomposition

Weighted clique

Weighted feedback vertex set

Weighted independent set

bandwidth

booleanwidth

branchwidth

carvingwidth

chromatic number

cliquewidth

cutwidth

degeneracy

diameter

distance to block

distance to clique

distance to cluster

distance to co-cluster

distance to cograph

distance to linear forest

distance to outerplanar

genus

maximum clique

maximum degree

maximum independent set

maximum induced matching

maximum matching

max-leaf number

minimum clique cover

minimum dominating set

pathwidth

rankwidth

tree depth

treewidth

vertex cover