Some algebraic methods for calculating the number of colorings of a graph

DOI10.1023/B:JOTH.0000024621.54839.40zbMATH Open1063.05046OpenAlexW2004160044MaRDI QIDQ1781373

Yu. V. Matiyasevich

Publication date: 24 June 2005

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:joth.0000024621.54839.40

zbMATH Keywords

polynomial

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The graph polynomial and the number of proper vertex colorings

This page was built for publication: Some algebraic methods for calculating the number of colorings of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781373)