A linear-time algorithm for the strong chromatic index of Halin graphs

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages

Scientific paper

We show that there exists a linear-time algorithm that computes the strong
chromatic index of Halin graphs.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-96224

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.