Delaney-Dress graphs




Nico Van Cleemput

This page is under construction.

Here you will find the generator described in the paper

N. Van Cleemput, Generating Delaney-Dress graphs, submitted to Discrete Applied Mathematics.


The ddgraphs project is released under the GNU General Public License (GPL) with the following copyright notice

Copyright (C) 2011-2013 Universiteit Gent

This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or (at
your option) any later version.

This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
General Public License for more details.

A copy of the GNU General Public License can be found in the file
LICENSE.txt provided with the source distribution of this program (see
the META-INF directory in the source jar). This license can also be
found on the GNU website at

If you did not receive a copy of the GNU General Public License along
with this program, contact the lead developer, or write to the Free
Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
You can download the source files here:


  • Extract the file you downloaded above into a directory named ddgraphs.
  • Download nauty version 2.4 from the nauty page.
  • Extract the files of nauty into a directory.
  • Open a terminal and cd into that directory. Run ./configure.
  • Copy the following files to the ddgraphs directory: nausparse.c, nausparse.h, nautil.c, nauty.c and nauty.h.
  • In the terminal cd to the ddgraphs directory and run make.


The program ddgraphs constructs Delaney-Dress graphs or related structures of a given order n.

Usage: ./ddgraphs [options] n

The n stands for the desired number of vertices.
Without any options, this program will generate cubic pregraphs that have a 2-factor where each component is the quotient of a 4-cycle.

Valid options:
-h Print help and return.
-o c Specifies the export format where c is one of
     c    binary code
     h    human-readable output in tabular format
     n    no output : only count (default)
-m r:n Split the generation in multiple parts. The generation is split into n parts and only part r is generated. The number n needs to be an integer larger than 0 and r should be a positive integer smaller than n.
-L Generate block lists.
-t Generate cubic pregraphs with a marked 2-factor.
-c Generate Delaney-Dress graphs, i.e., graphs that are the underlying graphs of Delaney-Dress symbols and in which the edges are coloured with the colours 0, 1 or 2.
-b Only generate Delaney-Dress graphs that are bipartite.
-O Only generate Delaney-Dress graphs that (may) correspond to orientable tilings.

If you download any of these files, we would appreciate to receive an e-mail which lets us know that you have done so.

Last update: September 19, 2013