2. Find a chordal graph for which the degeneracy ordering (the ordering obtained by repeatedly deleting a vertex of minimum degree) is not an elimination ordering (an ordering in which every vertex and its later neighbors form a clique). If your graph has more than one degeneracy ordering then none of its degeneracy orderings should be elimination orderings. (Because your graph is chordal, it should have at least one elimination ordering. Hint: Choose your graph so that there is only one possible starting vertex for the degeneracy ordering, and so that the neighbors of that vertex do not form a clique.) 2. Find a chordal graph for which the degeneracy ordering (the ordering obtained by repeatedly deleting a vertex of minimum degree) is not an elimination ordering (an ordering in which every vertex and its later neighbors form a clique). If your graph has more than one degeneracy ordering then none of its degeneracy orderings should be elimination orderings. (Because your graph is chordal, it should have at least one elimination ordering. Hint: Choose your graph so that there is only one possible starting vertex for the degeneracy ordering, and so that the neighbors of that vertex do not form a clique.)