B: n=6 |E|=8 degrees=[3, 1, 3, 3, 3, 3] connected=True planar=True |Aut|=4 (own 4) orbits=[(0,), (1,), (2, 3), (4, 5)] vertex-transitive=False
PASS B own automorphism search agrees with networkx
C10: n=10 |E|=15 degrees=[3, 3, 3, 3, 3, 3, 3, 3, 3, 3] connected=True planar=True |Aut|=32 (own 32) orbits=[(0, 1), (2, 3, 6, 7), (4, 5, 8, 9)] vertex-transitive=False
PASS C10 own automorphism search agrees with networkx
A: n=6 |E|=10 degrees=[2, 4, 4, 3, 3, 4] connected=True planar=True |Aut|=4 (own 4) orbits=[(0,), (1, 2), (3, 4), (5,)] vertex-transitive=False
PASS A own automorphism search agrees with networkx
PASS B degrees (3,1,3,3,3,3)
PASS B: {2,3,4,5} spans K4 minus 23
PASS C10 connected 3-regular
PASS C10 |Aut| = 32, orbits {0,1},{2,3,6,7},{4,5,8,9}
PASS C10 = B with leaf 1 replaced by a mirror diamond (subgraph on 0..5 minus the edges at 1 equals B minus leaf)
PASS figure edges of B = text edges
PASS figure edges of C10 = text edges
PASS check_note.py B edges = note
PASS check_note.py C10 edges = note
PASS check_note.py A edges = note
PASS check_note.py Bm45 edges = note
PASS original/cert_exact.py B edges = note
PASS original/cert_exact.py C10 edges = note
PASS original/cert_exact.py A edges = note
TOTAL FAIL: 0 []
