A linear-time algorithm for the strong chromatic index of Halin graphs
classification
💻 cs.DS
keywords
algorithmchromaticgraphshalinindexlinear-timestrongcomputes
read the original abstract
We show that there exists a linear-time algorithm that computes the strong chromatic index of Halin graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.