<｜begin▁of▁sentence｜>### Instruction:
Given a graph with an edge set [(1, 2), (1, 3), (2, 3), (3, 4), (4, 5), (5, 6), (6, 1)], can you find a vertex ordering for graph coloring, such that the 'smallest' nodes (in terms of degree) are placed last in the order?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([(1, 2), (1, 3), (2, 3), (3, 4), (4, 5), (5, 6), (6, 1)])

# Apply the smallest last strategy
ordering = list(nx.coloring.strategy_smallest_last(G))

print('Smallest last ordering:', ordering)
<|EOT|>
