Header menu link for other important links
X
A Dirac-type characterization of k-chordal graphs
R. Krithika, , N.S. Narayanaswamy, N. Sadagopan
Published in
2013
Volume: 313
   
Issue: 24
Pages: 2865 - 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. © 2013 Elsevier B.V. All rights reserved.
About the journal
JournalDiscrete Mathematics
ISSN0012365X