Gröbner Bases Techniques for an $S$-Packing $k$-Coloring of a Graph

  • Hamid Maarouf
DOI: https://doi.org/10.37236/6156
Keywords: Gröbner basis, Zero dimensional ideal, $S$-packing colorings, Shape's lemma

Abstract

In this paper, polynomial ideal theory is used to deal with the problem of the $S$-packing coloring of a finite undirected and unweighted graph by introducing a family of polynomials encoding the problem. A method to find the $S$-packing colorings of the graph is presented and illustrated by examples.
Published
2017-08-25
How to Cite
Maarouf, H. (2017). Gröbner Bases Techniques for an $S$-Packing $k$-Coloring of a Graph. The Electronic Journal of Combinatorics, 24(3), P3.33. https://doi.org/10.37236/6156
Issue
Volume 24, Issue 3 (2017)
Article Number
P3.33