Now showing 1 - 1 of 1
Placeholder Image
Publication

A Dirac-type characterization of k-chordal graphs

04-10-2013, Krithika, R., Mathew, Rogers, N S Narayanaswamy, Sadagopan, N.

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 Elsevier B.V. All rights reserved.