Graphs of low chordality - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2005

Graphs of low chordality


The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. The odd (even) chordality is defined to be the length of the longest induced odd (even) cycle in it. Chordal graphs have chordality at most 3. We show that co-circular-arc graphs and co-circle graphs have even chordality at most 4. We also identify few other classes of graphs having bounded (by a constant) chordality values.
Fichier principal
Vignette du fichier
59-75-1-PB.pdf (83.33 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission

Dates and versions

hal-00959026 , version 1 (12-06-2014)



Sunil L. Chandran, Vadim V. Lozin, C.R. Subramanian. Graphs of low chordality. Discrete Mathematics and Theoretical Computer Science, 2005, Vol. 7, pp.25-36. ⟨10.46298/dmtcs.343⟩. ⟨hal-00959026⟩


130 View
783 Download



Gmail Facebook X LinkedIn More