Atlas home || Conferences | Abstracts | about Atlas

21st Cumberland Conference on Graph Theory, Combinatorics, and Computing ---In Honor of Mike Plummer's 70th Birthday
May 15-17, 2008
Vanderbilt University
Nashville, TN, USA

Organizers
Mark Ellingham and Gexin Yu

View Abstracts
Conference Homepage

(C4, diamond)-free graphs
by
Elaine M. Eschen
West Virginia University
Coauthors: Chính T. Hoàng (Wilfrid Laurier University) Jeremy P. Spinrad (Vanderbilt University) R. Sritharan (The University of Dayton)

In general, it is not clear how to generalize results on chordal graphs to C4-free graphs and there are a number of open questions regarding C4-free graphs. We consider the class of (C4, diamond)-free graphs. We provide an efficient recognition algorithm, and count the number of maximal cliques and the number of n-vertex labeled graphs. We also give an efficient algorithm for finding a largest clique in the more general class of (house, diamond)-free graphs.

Date received: April 18, 2008

Copyright © 2008 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cawn-49.