Discrete Mathematics & Theoretical Computer Science


Volume 7 n° 1 (2005), pp. 25-36

author:L. Sunil Chandran and Vadim V. Lozin and C.R. Subramanian
title:Graphs of low chordality
keywords:induced cycles, chordality
abstract: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.

If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files.

reference: L. Sunil Chandran and Vadim V. Lozin and C.R. Subramanian (2005), Graphs of low chordality, Discrete Mathematics and Theoretical Computer Science 7, pp. 25-36
bibtex:For a corresponding BibTeX entry, please consider our BibTeX-file.
ps.gz-source:dm070103.ps.gz (46 K)
ps-source:dm070103.ps (131 K)
pdf-source:dm070103.pdf (87 K)

The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.

Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.

Automatically produced on Sat Apr 2 17:27:48 CEST 2005 by falk