<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(1, 2), (1, 3), (2, 3), (2, 4), (3, 4), (3, 5), (3, 6), (4, 5), (4, 6), (5, 6)], can you use the NetworkX function 'is_chordal' to check if this graph is a chordal graph?
### Response:
import networkx as nx

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

# Check if the graph is chordal
is_chordal_graph = nx.is_chordal(G)
print('Is the graph chordal?', is_chordal_graph)
<|EOT|>
