Cliques in Odd-Minor-Free Graphs

Details Cliques in Odd-Minor-Free Graphs Cliques in Odd-Minor-Free Graphs

2011-08-15

arxiv.org/abs/1108.2949v2

Mathematics

Combinatorics

Scientific paper

This paper is about: (1) bounds on the number of cliques in a graph in a particular class, and (2) algorithms for listing all cliques in a graph. We present a simple algorithm that lists all cliques in an $n$-vertex graph in O(n) time per clique. For O(1)-degenerate graphs, such as graphs excluding a fixed minor, we describe a O(n) time algorithm for listing all cliques. We prove that graphs excluding a fixed odd-minor have $O(n^2)$ cliques (which is tight), and conclude a $O(n^3)$ time algorithm for listing all cliques.

Affiliated with

Also associated with

No associations

Rating

Cliques in Odd-Minor-Free Graphs 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 Cliques in Odd-Minor-Free Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cliques in Odd-Minor-Free Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-301319