Path Multicoloring in Spider Graphs with Even Color Multiplicity
Publication Date
May 2018
Document Type
Article
Publication Title
Information Processing Letters
Volume
133
DOI
10.1016/j.ipl.2017.12.009
First Page
1
Last Page
58
Abstract
We give an exact polynomial-time algorithm for the problem of coloring a collection of paths defined on a spider graph using a minimum number of colors (Min-PMC), while respecting a given even maximum admissible color multiplicity on each edge. This complements a previous result on the complexity of Min-PMC in spider graphs, where it was shown that, for every odd k, the problem is NP-hard in spiders with admissible color multiplicity k on each edge. We also obtain an exact polynomial-time algorithm for maximizing the number of colored paths with a given number of colors (Max-PMC) in spider graphs with even admissible color multiplicity on each edge.
Keywords
Path multicoloring, Spider graph, Algorithms
Recommended Citation
Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, and Katerina Potika. "Path Multicoloring in Spider Graphs with Even Color Multiplicity" Information Processing Letters (2018): 1-58. https://doi.org/10.1016/j.ipl.2017.12.009
