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 3 disjoint copies of the complete graph K 4 (copy g has vertices g 4, ..., g 4+3), where for each g < 2 and each i < 4 vertex g 4+i is also joined to vertex…
The task
Let G be the graph with 12 vertices 0..11 made of 3 disjoint copies of the complete graph K_4 (copy g has vertices g*4, ..., g*4+3), where for each g < 2 and each i < 4 vertex g*4+i is also joined to vertex (g+1)*4+i. G has 26 edges, in this order (index: edge): 0:(0,1), 1:(0,2), 2:(0,3), 3:(1,2), 4:(1,3), 5:(2,3),…