Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph (Q2401415)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6772905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph |
scientific article; zbMATH DE number 6772905 |
Statements
Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph (English)
0 references
8 September 2017
0 references
In this interesting paper, the author uses combinatorial commutative algebra theory to study 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.
0 references
Gröbner basis
0 references
zero dimensional ideal
0 references
\(S\)-packing colorings
0 references
Shape's lemma
0 references
0 references
0 references
0.9031698
0 references
0.9020941
0 references
0.89768755
0 references
0.89541876
0 references
0.8940916
0 references
0 references
0.8853552
0 references
0.8842719
0 references
