  Characterization of k-chordal graphs based on the existence of a "simplicial
path" was shown in [Chv{\'a}tal et al. Note: Dirac-type characterizations of
graphs without long chordless cycles. Discrete Mathematics, 256, 445-448,
2002]. We give a characterization of k-chordal graphs which is a generalization
of the known characterization of chordal graphs due to [G. A. Dirac. On rigid
circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25, 71-76, 1961] that use
notions of a "simplicial vertex" and a "simplicial ordering".
