English Dually chordal graph Cited by user David Eppstein on 22 Aug 2023 In the mathematical area of graph theory, an undirected graph G is dually chordal if the hypergraph of its maximal cliques is a hypertree.