This paper presents algorithms for s-packing coloring in graphs, assessing their complexity and comparing outcomes.
S -packing coloring is a generalization of proper coloring of graphs, introduced more than a decade ago. In this paper, we present algebraic and combinatorial algorithms for the problem of S -packing coloring of finite undirected and unweighted graphs. We assess the upper bounds for the complexity of our algorithms and of an existing algebraic algorithm by Maarouf [Electron. J. Combin. 2017]. We also provide a comparative evaluation of these algorithms.
No takes yet. Share an insight, caveat, or question.
Harith et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: