CONTEST B: THEORY SURPRISE

Preamble

The graph for Contest C is an elegant graph of theoretical significance that appears to be quite difficult to draw well. Further information about the graph will be withheld until the presentation ceremony.

Data Format

The data are given in the following format:

graph [
  graph attributes
  node list
  edge list
]

Node list:

node [
  node attributes
]

Edge list:

edge [
  edge attributes
  graphics [
  graphical attributes
  ]
]

Note that there are two nodes with self-loops.

Questions about this graph should be addressed to Franz Brandenburg <brandenb@fmi.uni-passau.de>.