1Two empty graphs: 2( ) 3 4Two singleton graphs: 5( 0 ) 6 7Empty and singleton graphs: 8 9Two rings: 10( 0 1 2 3 4 ) 11( 0 4 3 2 1 ) 12( 1 0 4 3 2 ) 13( 1 2 3 4 0 ) 14( 2 1 0 4 3 ) 15( 2 3 4 0 1 ) 16( 3 2 1 0 4 ) 17( 3 4 0 1 2 ) 18( 4 0 1 2 3 ) 19( 4 3 2 1 0 ) 20 21Two directed rings: 22( 0 1 2 3 4 ) 23( 1 2 3 4 0 ) 24( 2 3 4 0 1 ) 25( 3 4 0 1 2 ) 26( 4 0 1 2 3 ) 27 28Two rings where node parity should be equal: 29( 0 1 2 3 4 ) 30( 4 3 2 1 0 ) 31 32Two rings where edge parity should be equal: 33( 0 1 2 3 4 ) 34( 0 4 3 2 1 ) 35 36Two rings with only one vertex coloring: 37( 0 1 2 3 4 ) 38( 0 4 3 2 1 ) 39( 1 0 4 3 2 ) 40( 1 2 3 4 0 ) 41( 2 1 0 4 3 ) 42( 2 3 4 0 1 ) 43( 3 2 1 0 4 ) 44( 3 4 0 1 2 ) 45( 4 0 1 2 3 ) 46( 4 3 2 1 0 ) 47 48Two rings with vertex coloring: 49( 0 1 2 3 4 ) 50( 4 3 2 1 0 ) 51 52Two rings with edge coloring: 53( 0 1 2 3 4 ) 54( 0 4 3 2 1 ) 55 56Two rings where node of graph 1 should not be 3 higher than node of graph 2: 57( 0 1 2 3 4 ) 58( 1 0 4 3 2 ) 59( 1 2 3 4 0 ) 60( 2 1 0 4 3 ) 61( 2 3 4 0 1 ) 62( 4 0 1 2 3 ) 63( 4 3 2 1 0 ) 64 65Two rings with different directedness. 66 67