<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edge set [(1, 2), (1, 3), (2, 3), (2, 4), (3, 4), (3, 5), (3, 6), (4, 5), (4, 6), (5, 6)], can you determine if it is a chordal graph using the is_chordal function from NetworkX?
### Response:
import networkx as nx

# Create a graph with edges forming a chordal graph
e = [
    (1, 2),
    (1, 3),
    (2, 3),
    (2, 4),
    (3, 4),
    (3, 5),
    (3, 6),
    (4, 5),
    (4, 6),
    (5, 6),
]
G = nx.Graph(e)
# Check if the graph is chordal
is_chordal_graph = nx.is_chordal(G)
print('Is the graph chordal?', is_chordal_graph)
<|EOT|>
