Given a partial cube , the -graph of has -classes of as its vertices, and two vertices in it are adjacent if the corresponding -classes meet in a vertex of . We present a counter-example to the question from whether -graphs of graphs of acyclic cubical complexes are always dually chordal graphs. On a positive side, we show that in the class of ACC -expansion graphs, each -graph is both a dually chordal and a chordal graph. In the proof, a fundamental characterization of -acyclic hypergraphs is combined with techniques from metric graph theory. Along the way, we also introduce a new, weaker version of simplicial elimination scheme, which yields yet another characterization of chordal graphs.