Chromatic Polynomials
From MaRDI portal
Publication:5839327
DOI10.2307/1990348zbMath0060.41601OpenAlexW4232224617MaRDI QIDQ5839327
George D. Birkhoff, D. C. jun. Lewis
Publication date: 1946
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1990348
Related Items
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs, Chromatic zeros on hierarchical lattices and equidistribution on parameter space, A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings, Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs, \(\sigma\)-polynomials and graph coloring, A categorification for the signed chromatic polynomial, Density of Chromatic Roots in Minor-Closed Graph Families, The number of \(k\)-colorings of a graph on a fixed surface, A zero-free interval for flow polynomials of cubic graphs, Hyperbolic families and coloring graphs on surfaces, The number of colorings of planar graphs with no separating triangles, A Zero-Free Interval for Chromatic Polynomials of Graphs, The largest real zero of the chromatic polynomial, A bibliography on chromatic polynomials, On graphs whose flow polynomials have real roots only, Counting pure \(k\)-cycles in sequences of Cayley graphs, On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs, Inapproximability of the Tutte polynomial of a planar graph, Exponentially many 5-list-colorings of planar graphs, Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings, Analysis approach to finite monoids, An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\), Upper bounds on the chromatic polynomial of a connected graph with fixed clique number, Combinatorial map theory, Limits of chromatic zeros of some families of maps, A proof of Tomescu's graph coloring conjecture, Unnamed Item, Approximating the chromatic polynomial is as hard as computing it exactly, Partition coefficients of acyclic graphs, The ratio of the numbers of odd and even cycles in outerplanar graphs, A homomorphic polynomial for oriented graphs, The matrix of chromatic joins and the Temperley-Lieb algebra., Some array polynomials over special monoid presentations, Two classes of chromatically unique graphs, Boundary values in chromatic graph theory, A note on the permanental roots of bipartite graphs, Unnamed Item, Chromatic bounds on orbital chromatic roots, Is the five-flow conjecture almost false?, Problems related to type-\(A\) and type-\(B\) matrices of chromatic joins, On planar and non-planar graphs having no chromatic zeros in the interval(1,2), On the Birkhoff-Lewis equations, The Chromatic Polynomial of the Truncated Icosahedron, A new invariant of plane bipartite cubic graphs, An inequality for chromatic polynomials, A zero-free interval for chromatic polynomials, CHROMATIC POLYNOMIALS AND BIALGEBRAS OF GRAPHS, A generalization of chromatic polynomial of a graph subdivision, [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions], Zero-free intervals of chromatic polynomials of hypergraphs, Boundary Values in the Four Color Problem, On zero-free intervals of flow polynomials, Is the four-color conjecture almost false?, Expansions of Chromatic Polynomials and Log-Concavity, Geometric coloring theory, A generalized Beraha conjecture for non-planar graphs, A systematic approach to the determination of reducible configurations in the four-color conjecture, Modular Constructions for Combinatorial Geometries, ℱ-WORM colorings of some 2-trees: partition vectors, On the roots of chromatic polynomials, On golden identities for constrained chromials, Chromatic Roots and Minor-Closed Families of Graphs, Regular major maps of at most 19 regions and their Q-chromials, Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs, Even subgraph expansions for the flow polynomial of cubic plane maps, On Tutte’s chromatic invariant, DP color functions versus chromatic polynomials, The maximum number of colorings of graphs of given order and size: a survey, On cycles in the sequence of unitary Cayley graphs, Bijective Proofs of Proper Coloring Theorems, Maximum number of colourings: 4-chromatic graphs, Catalan, Motzkin, and Riordan numbers, A survey of the asymptotic behaviour of maps, Subdivisions and chromatic roots, On graphs having no flow roots in the interval \((1,2)\), Classes of chromatically unique or equivalent graphs, Polynomial Invariants of Graphs, Occurrences of reciprocal sign epistasis in single- and multi-peaked theoretical fitness landscapes
