A Dirac-type characterization of k-chordal graphs

Date Issued
04-10-2013
Author(s)
Krithika, R.
Mathew, Rogers
Indian Institute of Technology, Madras
Sadagopan, N.
DOI
Abstract
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.
Volume
313
Subjects