Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs

Details Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs

2011-10-04

arxiv.org/abs/1110.0583v1

Computer Science

Data Structures and Algorithms

Scientific paper

We show that there exist linear-time algorithms that compute the strong
chromatic index of Halin graphs, of maximal outerplanar graphs and of
distance-hereditary graphs.

Affiliated with

Also associated with

No associations

Rating

Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar 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 Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-267698