graphs read: 95 ; marked as doubles by lead_coverage.py: 4
connected graphs with at most 6 vertices that are not joins: {2: 0, 3: 0, 4: 1, 5: 8, 6: 68}
listed graphs of the form M_k(G^, t), k >= 2: 4
   [(0, 3), (0, 5), (1, 4), (1, 5), (2, 5), (2, 6), (3, 6), (4, 6)] = M_2 of [(0, 1), (0, 4), (1, 2), (2, 3), (3, 4)] ; marked as double: True
   [(0, 4), (0, 5), (0, 6), (1, 4), (1, 5), (1, 6), (2, 5), (3, 6)] = M_2 of [(0, 1), (1, 3), (1, 4), (2, 3), (2, 4)] ; marked as double: True
   [(0, 3), (0, 5), (1, 4), (1, 5), (2, 5), (2, 6), (3, 6), (4, 6), (5, 6)] = M_2 of [(0, 1), (0, 3), (0, 4), (1, 2), (2, 3), (3, 4)] ; marked as double: True
   [(0, 3), (0, 5), (0, 6), (1, 4), (1, 5), (1, 6), (2, 5), (2, 6), (3, 6), (4, 6)] = M_2 of [(0, 1), (0, 3), (0, 4), (1, 2), (2, 3), (3, 4)] ; marked as double: True
doubles (k = 2): 4 ; further graphs with k >= 3 only: 0
RESULT: AGREES WITH lead_coverage.py
