University of Duisburg-Essen / Institute for Experimental Mathematics / Computer Networking Technology Group / Thomas Dreibholz


Generating Trivalent Graphs
Implementations to my 1997 practical training


News


Description

These programs are the implementation to my practical training "Generierung trivalenter Graphen-Listen" (Generating Trivalent Graph Lists). Trivalent graphs are connected and have all vertices of degree less or equal 3. All graphs of the list are non-isomorphic.


Project members


Screenshots

Click here to view some screenshots!


Download


Requirements


Useful Links


28.01.2011 Thomas Dreibholz, University of Duisburg-Essen / Institute for Experimental Mathematics / Computer Networking Technology Group

Valid XHTML 1.1! Valid CSS!