A Determinant Formula for the Number of Ways of Coloring a Map

1912/01/01 by George D. Birkhoff · 28 citations
Computer Science · #Data Management and Algorithms

paper · doi:10.2307/1967597

Cited by

• An e-positive classification for complete multipartite graphs
• Exact thresholds for Schur positivity of the lattices \mathbf m×\mathbf 2 and \mathbf m×\mathbf 3
• The unlabeled list color function of disconnected graphs
• Orientations, lattice polytopes, and group arrangements III: Cartesian product arrangements and applications to the Tutte type polynomials of graphs
• Understanding Interpretability by generalized distillation in Supervised\n Classification
• Chromatic Polynomial Evaluation Spectra
• A zero-free interval for chromatic polynomials of graphs with 3-leaf\n spanning trees
• A logician's view of graph polynomials
• Stability of combinatorial polynomials and its applications
• Long paths need not minimize H-colorings among trees
• On the complexity of generalized chromatic polynomials
• Graphical configuration spaces, Contractads and Formality
• A set of chromatic roots which is dense in the complex plane and closed\n under multiplication by positive integers
• Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
• List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph
• Upper Bound for the Coefficients of Chromatic polynomials
• Reconstructing Rooted Trees From Their Strict Order Quasisymmetric Functions
• Triangular Ladders P_d,2 are e-positive
• On the number of Hamiltonian cycles and polynomial invariants of graphs
• Multivariate Tutte polynomials of semimatroids
• On the DP-chromatic Number of Cartesian Products of Critical Graphs
• Graph polynomials and approximation of partition functions with Loopy Belief Propagation
• Graph colorings under global structural conditions
• The Orbital Bivariate Chromatic Polynomial
• Curvature from Graph Colorings
• Maximizing proper colorings on graphs
• Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
• DP color functions versus chromatic polynomials