[DMANET] ISGCI graph classes database now also in Sage

Dear colleagues,

the Information System on Graph Classes and their Inclusions (ISGCI) [1],
available at http://www.graphclasses.org lists over 1300 graph classes with
their definitions, references and computational complexity for 15 graph
theoretical problems. In ISGCI you can check the relation between graph
classes, create coloured class inclusion diagrams and export these as
Postscript, SVG graphics or GraphML file.

The database of ISGCI is now also available from within the Sage mathematics
system [2].

Sage is meant to become a free open-source alternative to proprietary
mathematics softwares like Magma, Maple, Mathematica or Matlab, and includes
a significant set of functions for the study of graph theory [3]. Its new
interface with ISGCI [4] is a first step toward using graph properties as a
way to improve the runtime of implemented algorithms. We also hope that it
will encourage contributions to the database itself, as well as the
development of recognition algorithms for more graph classes.

For questions or suggestions on ISGCI, please contact
hnridder@graphclasses.org
For questions or suggestions on sage.graphs.isgci, please contact
nathann.cohen@gmail.com
or write to the sage-support google group.

ISGCI originated at Rostock University, Dept. of Theoretical Computer
Science.

With kind regards,
Nathann Cohen (nathann.cohen@gmail.com)
Ernst de Ridder (hnridder@graphclasses.org)

[1] http://www.graphclasses.org
[2] http://sagemath.org/
[3] http://www.sagemath.org/doc/reference/graphs.html
[4] http://www.sagemath.org/doc/reference/sage/graphs/isgci.html

--
Information System on Graph Classes and their Inclusions (ISGCI)
http://www.graphclasses.org
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************