Bivariate chromatic polynomials in computer algebra

DOI10.1016/j.jsc.2018.06.006zbMath1418.68247OpenAlexW2807951261MaRDI QIDQ1733312

Melanie Gerling

Publication date: 21 March 2019

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2018.06.006

zbMATH Keywords

algorithmsgraph theory

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• Maple
• Mathematica
• GraphTheory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On multivariate chromatic polynomials of hypergraphs and hyperedge elimination
• Chromatic polynomials of complements of bipartite graphs
• On colorings of split graphs
• Proving properties of the edge elimination polynomial using equivalent graph polynomials
• Einführung in die Kombinatorik
• A Most General Edge Elimination Polynomial
• An introduction to chromatic polynomials

This page was built for publication: Bivariate chromatic polynomials in computer algebra