A linear-time algorithm for the strong chromatic index of Halin graphs
Abstract
We show that there exists a linear-time algorithm that computes the strong chromatic index of Halin graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.