<｜begin▁of▁sentence｜>### Instruction:
Given a cycle graph with 4 nodes, how can we determine a proper vertex coloring using the greedy independent set removal strategy provided by NetworkX's `strategy_independent_set` function?
### Response:
import networkx as nx
from networkx.algorithms.coloring import greedy_color

# Create a graph
G = nx.cycle_graph(4)

# Apply the strategy_independent_set heuristic for graph coloring
# Note: The function modifies the graph in-place, and since it returns None, we do not assign the result
# Instead, we pass the strategy as an argument
coloring = greedy_color(G, strategy='independent_set')

# Print the coloring
print(coloring)
<|EOT|>
