What is Hamilton cycle? Give one example. Let G= (V, E) is an undirected graph with four vertices. Draw the state space tree for coloring all the four nodes using only tree colors.
Subject Algorithm Design
NU Year Set: 3.(b) Marks: 5 Year: 2012
Login to post your comment.