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