Title of article
A Dirac-type characterization of -chordal graphs
Author/Authors
Krithika، نويسنده , , R. and Mathew، نويسنده , , Rogers and Narayanaswamy، نويسنده , , N.S. and Sadagopan، نويسنده , , N.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
3
From page
2865
To page
2867
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.
Keywords
k -chordal graphs , characterization , Simplicial ordering , simplicial vertex
Journal title
Discrete Mathematics
Serial Year
2013
Journal title
Discrete Mathematics
Record number
1600524
Link To Document