Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph
The electronic journal of combinatorics, Tome 24 (2017) no. 3
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl
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.
DOI :
10.37236/6156
Classification :
13P10, 13P15, 05C15
Mots-clés : Gröbner basis, zero dimensional ideal, \(S\)-packing colorings, Shape's lemma
Mots-clés : Gröbner basis, zero dimensional ideal, \(S\)-packing colorings, Shape's lemma
Affiliations des auteurs :
Hamid Maarouf  1
Hamid Maarouf. Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph. The electronic journal of combinatorics, Tome 24 (2017) no. 3. doi: 10.37236/6156
@article{10_37236_6156,
author = {Hamid Maarouf},
title = {Gr\"obner bases techniques for an {\(S\)-packing} \(k\)-coloring of a graph},
journal = {The electronic journal of combinatorics},
year = {2017},
volume = {24},
number = {3},
doi = {10.37236/6156},
zbl = {1405.13049},
url = {http://geodesic.mathdoc.fr/articles/10.37236/6156/}
}
Cité par Sources :