2012/06/23 by R. Krithika, Rogers Mathew, Krithika, R. +5
Computer Science · Engineering · #05C75 #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1206.5397
openalex publication_date 2012/06/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Characterization of k-chordal graphs based on the existence of a "simplicial path" was shown in [Chvá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".