Optimal antithickenings of claw-free trigraphs

Details Optimal antithickenings of claw-free trigraphs Optimal antithickenings of claw-free trigraphs

2011-10-24

arxiv.org/abs/1110.5111v1

Computer Science

Discrete Mathematics

19 pages, 2 figures

Scientific paper

Chudnovsky and Seymour's structure theorem for claw-free graphs has led to a multitude of recent results that exploit two structural operations: {\em compositions of strips} and {\em thickenings}. In this paper we consider the latter, proving that every claw-free graph has a unique optimal {\em antithickening}, where our definition of {\em optimal} is chosen carefully to respect the structural foundation of the graph. Furthermore, we give an algorithm to find the optimal antithickening in $O(m^2)$ time. For the sake of both completeness and ease of proof, we prove stronger results in the more general setting of trigraphs.

Affiliated with

Also associated with

No associations

Rating

Optimal antithickenings of claw-free trigraphs 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 Optimal antithickenings of claw-free trigraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal antithickenings of claw-free trigraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-519529