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

Published 19 Sep 2011 in cs.DS | (1109.3934v1)

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

No one has generated a summary of this paper yet.

No one has generated a video about this paper yet.

No one has generated a whiteboard explanation for this paper yet.

We haven't generated a list of open problems mentioned in this paper yet.

We haven't generated follow-up questions for this paper yet.