Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph

zbMath1405.13049MaRDI QIDQ2401415

Hamid Maârouf

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p33

zbMATH Keywords

Gröbner basiszero dimensional ideal\(S\)-packing coloringsShape's lemma

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Coloring of graphs and hypergraphs (05C15) Solving polynomial systems; resultants (13P15)

Related Items (2)

\(S\)-packing chromatic vertex-critical graphs ⋮ On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Gröbner bases and graph colorings
• Recognizing graph theoretic properties with polynomial ideals
• Algebraic characterization of uniquely vertex colorable graphs
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• The S-packing chromatic number of a graph
• A new incremental algorithm for computing Groebner bases
• A graph coloring algorithm for large scheduling problems
• The $L(2,1)$-Labeling Problem on Graphs
• Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility

This page was built for publication: Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph