On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs

Details On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs

2011-10-08

arxiv.org/abs/1110.1693v1

Computer Science

Data Structures and Algorithms

Scientific paper

We show that there exist linear-time algorithms that compute the strong
chromatic index and a maximum induced matching of tree-cographs when the
decomposition tree is a part of the input. We also show that there exists an
efficient algorithm for the strong chromatic index of permutation graphs.

Affiliated with

Also associated with

No associations

Rating

On the strong chromatic index and maximum induced matching of tree-cographs and permutation 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 On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the strong chromatic index and maximum induced matching of tree-cographs and permutation graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-497136