<｜begin▁of▁sentence｜>### Instruction:
Given a cycle graph with 4 nodes, how can we compute an equitable coloring using 3 colors, where no two adjacent nodes have the same color and the number of nodes with each color differ by at most 1?
### Response:
import networkx as nx

# Create a cycle graph with 4 nodes
g = nx.cycle_graph(4)

# Compute an equitable coloring using 3 colors
coloring = nx.coloring.equitable_color(g, num_colors=3)

print('Equitable Coloring:', coloring)
<|EOT|>
