<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(0, 1), (0, 2), (1, 2), (1, 3), (3, 4), (4, 5), (5, 3)], can you determine the subgraph that contains only the nodes of degree 3 or more using the k_core function from NetworkX?
### Response:
import networkx as nx

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

# Calculate the 3-core of the graph
k_core_subgraph = nx.k_core(G, k=3)

print('Nodes:', k_core_subgraph.nodes())
print('Edges:', k_core_subgraph.edges())
<|EOT|>
