Two empty graphs:
{
  0: ( )
}

Two singleton graphs:
{
  0: ( 0 )
}

Empty and singleton graphs:
{
}

Singleton and empty graphs:
{
  0: ( )
}

Ring with add vertex and edge (ring+) and ring:
{
  0: ( 0 1 2 3 5 )
  1: ( 0 5 3 2 1 )
  2: ( 1 0 5 3 2 )
  3: ( 1 2 3 5 0 )
  4: ( 2 1 0 5 3 )
  5: ( 2 3 5 0 1 )
  6: ( 3 2 1 0 5 )
  7: ( 3 5 0 1 2 )
  8: ( 5 0 1 2 3 )
  9: ( 5 3 2 1 0 )
}

Ring+ and ring, directed:
{
  0: ( 0 1 2 3 5 )
  1: ( 1 2 3 5 0 )
  2: ( 2 3 5 0 1 )
  3: ( 3 5 0 1 2 )
  4: ( 5 0 1 2 3 )
}

Ring+ and ring where node parity should be equal:
{
}

Ring+ and ring where edge parity should be equal:
{
  0: ( 1 0 5 3 2 )
  1: ( 1 2 3 5 0 )
}

Ring+ and ring with only one vertex coloring:
{
  0: ( 0 1 2 3 5 )
  1: ( 0 5 3 2 1 )
  2: ( 1 0 5 3 2 )
  3: ( 1 2 3 5 0 )
  4: ( 2 1 0 5 3 )
  5: ( 2 3 5 0 1 )
  6: ( 3 2 1 0 5 )
  7: ( 3 5 0 1 2 )
  8: ( 5 0 1 2 3 )
  9: ( 5 3 2 1 0 )
}

Ring+ and ring with vertex coloring:
{
  0: ( 0 1 2 3 5 )
  1: ( 5 3 2 1 0 )
}

Ring+ and ring with edge coloring:
{
  0: ( 0 1 2 3 5 )
  1: ( 0 5 3 2 1 )
}

Ring+ and ring where node of graph 1 should not be 3 higher than node of graph 2:
{
  0: ( 0 1 2 3 5 )
  1: ( 0 5 3 2 1 )
  2: ( 1 2 3 5 0 )
  3: ( 2 1 0 5 3 )
  4: ( 5 0 1 2 3 )
  5: ( 5 3 2 1 0 )
}

Ring+ and ring with different directedness.
{
}

Graph with loop edges.
{
}

