On the strong chromatic index and induced matching of tree-cographs, permutation graphs and chordal bipartite graphs

Details On the strong chromatic index and induced matching of tree-cographs, permutation graphs and chordal bipartite graphs On the strong chromatic index and induced matching of tree-cographs, permutation graphs and chordal bipartite graphs

2011-10-17

arxiv.org/abs/1110.3583v1

Mathematics

Combinatorics

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 exist
efficient algorithms for the strong chromatic index of (bipartite) permutation
graphs and of chordal bipartite graphs.

Affiliated with

Also associated with

No associations

Rating

On the strong chromatic index and induced matching of tree-cographs, permutation graphs and chordal bipartite 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 induced matching of tree-cographs, permutation graphs and chordal bipartite 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 induced matching of tree-cographs, permutation graphs and chordal bipartite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-317305