Bivariate chromatic polynomials in computer algebra
type: Item
instance of: scholarly article
title: Bivariate chromatic polynomials in computer algebra
zbMATH Open document ID: 1418.68247
author: Melanie Gerling
published in: Journal of Symbolic Computation
publication date: 2019-03-21T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7040041
zbMATH Keywords: graph theory
zbMATH Keywords: algorithms
describes a project that uses: GraphTheory
describes a project that uses: Mathematica
describes a project that uses: Maple
MaRDI profile type: Publication
full work available at URL: j.jsc.2018.06.006
OpenAlex ID: W2807951261
cites work: A Most General Edge Elimination Polynomial
cites work: Chromatic polynomials of complements of bipartite graphs
cites work: Q4398864
cites work: Q4449286
cites work: Q3416643
cites work: Q3395507
cites work: An introduction to chromatic polynomials
cites work: Q4000231
cites work: On colorings of split graphs
cites work: Einführung in die Kombinatorik
cites work: Proving properties of the edge elimination polynomial using equivalent graph polynomials
cites work: On multivariate chromatic polynomials of hypergraphs and hyperedge elimination
cites work: Q4718428
DOI: 10.1016/J.JSC.2018.06.006
description: scientific article; zbMATH DE number 7040041