On graphs without a C4 or a diamond

Details On graphs without a C4 or a diamond On graphs without a C4 or a diamond

2009-09-25

arxiv.org/abs/0909.4719v1

Computer Science

Discrete Mathematics

Scientific paper

We consider the class of (C4, diamond)-free graphs; graphs in this class do not contain a C4 or a diamond as an induced subgraph. We provide an efficient recognition algorithm for this class. We count the number of maximal cliques in a (C4, diamond)-free graph and the number of n-vertex, labeled (C4, diamond)-free graphs. We also give an efficient algorithm for finding a largest clique in the more general class of (house, diamond)-free graphs.

Affiliated with

Also associated with

No associations

Rating

On graphs without a C4 or a diamond does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On graphs without a C4 or a diamond, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On graphs without a C4 or a diamond will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-326256