Graph Drawing Contest 1996

Layouts by
Vladimir Batagelj and Andrej Mrvar
University of Ljubljana, Slovenia

Last change: 8. September 1996

Data and rules

See the page GD96 Graph-Drawing Contest or its mirror in Passau and GD96 Graph-Drawing Conference.
See also our layouts for Graph-Drawing Contests: GD95, GD97, GD98, GD99, GD00 and GD01.

How layouts of graphs were obtained

  1. Graph B
    • Automatically obtained layout using our program COORD. (positioning vertices on the rectangular net so that the number of crossings of lines is as low as possible).
    • Manual editing to reposition vertices using our graph picture editor DRAW.
  2. Graph C
    • Analysing graph C using our program RELCALC two parts were found and 2 connecting vertices.
    • Each part was handled separately using our program ENERG (minimisation of energy). One part consists of a lattice structure, and the second of a planar graph of cylindric symmetries. This spatial picture was realized in VRML (see also its description in our graph description language NetML based on SGML).
    • Some manual editing for planar representation.
  3. Graph D
    • Analysing graph D using program RELCALC 17 important vertices of "kernel graph" were found.
    • Automatically obtained layout for these 17 vertices using program COORD.
    • Other vertices were added to the picture obtained.
    • Some manual editing using DRAW to reposition vertices to avoid crossings.


  1. Graph B: layout B, types B, labels B.
  2. Graph C: layout C,
    VRML screen snapshot (GIF) C, VRML C,
    VRML (cylinder) screen snapshot (GIF) C, VRML (cylinder) C.
  3. Graph D: layout D, labels D.
Vladimir Batagelj, Department of Mathematics, University of Ljubljana
Andrej Mrvar, Faculty of Social Sciences, University of Ljubljana