Strict chordal digraphs viewed as graphs with distinguished edges

P. Hell and C. Hernández-Cruz recently defined new directed graph analogs of the traditional concepts of chordal and split graphs. This paper will provide additional evidence of the naturalness of their digraph analogs using characterizations in terms of undirected graphs with distinguished edges, most notably using standard clique tree representations from chordal graph theory.