Screenshots

The 'browse database' window. Currently the Berge graphs are selected. The window shows complexity of the Independent Set problem on Berge graphs (polynomial) and its super-, sub-, and equivalent classes.



The boundary between polynomial/NP-complete for the Independent Set problem, as seen when starting from bridged graphs. Red classes are NP-Complete, dark green are polynomial, light green are linear, while white are still open.



Finding and drawing the relation between $2K₂$ and $(2K₂,C₄,C₅)$-free graphs. A reference for the equivalence of $(2K₂,C₄,C₅)$-free and split graphs is displayed.



The same diagram, but with forbidden subgraph characterization as naming preference.