construct/mc graceful graph
construct/mc graceful graph: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Let G be the graph with 12 vertices 0..11 made of 4 disjoint copies of the complete graph K 3 (copy g has vertices g 3, ..., g 3+2), where for each g < 3 and each i < 3 vertex g 3+i is also joined to vertex…
The task
Let G be the graph with 12 vertices 0..11 made of 4 disjoint copies of the complete graph K_3 (copy g has vertices g*3, ..., g*3+2), where for each g < 3 and each i < 3 vertex g*3+i is also joined to vertex (g+1)*3+i. G has 21 edges, in this order (index: edge): 0:(0,1), 1:(0,2), 2:(1,2), 3:(3,4), 4:(3,5), 5:(4,5),…