A Dirac-type Characterization of k-chordal Graphs
Combinatorics
2013-01-01 v2 Discrete Mathematics
Abstract
Characterization of k-chordal graphs based on the existence of a "simplicial path" was shown in [Chv{\'a}tal et al. Note: Dirac-type characterizations of graphs without long chordless cycles. Discrete Mathematics, 256, 445-448, 2002]. We give a characterization of k-chordal graphs which is a generalization of the known characterization of chordal graphs due to [G. A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg, 25, 71-76, 1961] that use notions of a "simplicial vertex" and a "simplicial ordering".
Cite
@article{arxiv.1206.5397,
title = {A Dirac-type Characterization of k-chordal Graphs},
author = {R. Krithika and Rogers Mathew and N. S. Narayanaswamy and N. Sadagopan},
journal= {arXiv preprint arXiv:1206.5397},
year = {2013}
}
Comments
3 pages