A Dirac-type characterization of k-chordal graphs

作者：Krithika R^*; Mathew Rogers; Narayanaswamy N S; Sadagopan N

来源：Discrete Mathematics, 2013, 313(24): 2865-2867.

DOI：10.1016/j.disc.2013.08.032

• k-chordal graphs
• Characterization
• Simplicial vertex
• Simplicial ordering

A graph is k-chordal if it has no induced cycle of length greater than k. We give a new characterization of k-chordal graphs that generalizes the well-known characterization of chordal graphs by Dirac in terms of simplicial vertices and simplicial orderings.

• 出版日期2013-12-28