A determinant formula for the number of ways of coloring a map.

DOI10.2307/1967597zbMATH Open43.0574.02OpenAlexW2319873605WikidataQ56554718 ScholiaQ56554718MaRDI QIDQ1482336FDOQ1482336

George David Birkhoff

Publication date: 1912

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1967597

Cited In (11)

• New perspectives on polynomial invariants
• The chromatic polynomial of grid graph \(P_3 \square P_n\)
• Improved bounds for the zeros of the chromatic polynomial via Whitney's broken circuit theorem
• Independence number and maximal chromatic polynomials of connected graphs
• The chromatic symmetric function of a graph centred at a vertex
• The Fortuin-Kasteleyn polynomial as a bialgebra morphism and applications to the Tutte polynomial
• Chromatic symmetric functions and polynomial invariants of trees
• The chromaticity of complete split graphs
• Unimodal sequences: from Isaac Newton to June Huh
• The DP color function of clique-gluings of graphs
• A note on graphs of \(k\)-colourings

This page was built for publication: A determinant formula for the number of ways of coloring a map.

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