- Which properties of simple undirected graphs can be easily computed?
For example, are there (standard) menu options for the connectivity,
the independence number (=stability number), hamiltonicity etc?
- If I want to program new functions on graphs (properties which cannot
be computed by Link yet), in what language do I have to do that? Is that
an easy-to-learn language?
- Is it possible to (easily) generate (automatically) all graphs on at most
(for example) 15 vertices and check if these graphs have certain
properties (useful for investigating conjectures)?
Hilde Tuinstra