Graphs of low chordalityReportar como inadecuado

Graphs of low chordality - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 MPII - Max Planck Institut für Informatik 2 RUTCOR - Rutgers Center for Operations Research 3 IMSc - Institute of Mathematical Sciences India

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.

Keywords : induced cycles chordality

Autor: Sunil Chandran - Vadim V. Lozin - C.R. Subramanian -



Documentos relacionados