An introduction to chromatic polynomials
From MaRDI portal
Publication:5560915
DOI10.1016/S0021-9800(68)80087-0zbMath0173.26203MaRDI QIDQ5560915
Publication date: 1967
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items
On the chromatic uniqueness of bipartite graphs, Clique cover products and unimodality of independence polynomials, Distinctive power of the alliance polynomial for regular graphs, Classes of chromatically equivalent graphs and polygon trees, Chromatic polynomials of simplicial complexes, Graph products of the trivariate total domination polynomial and related polynomials, \(T\)-chromatic polynomials, Unimodality of independence polynomials of the incidence product of graphs, Chromaticity of the complements of paths and cycles, On the chromatic equivalence class of a family of graphs, Chromatic uniqueness in a family of 2-connected graphs, Chromatic sum equations for rooted cubic planar maps, Chromatic polynomials and network reliability, Decomposition of the flow polynomial, An application of the planar separator theorem to counting problems, A new method for proving chromatic uniqueness of graphs, On \(\sigma\)-polynomials, Chromatic classes of certain 2-connected \((n,n+2)\)-graphs homeomorphic to \(K_ 4\), Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II, Some problems on chromatic polynomials, On T-chromatic uniqueness of graphs, Chromaticity of a family of \(K_ 4\) homeomorphs, Adjoint polynomials and chromatically unique graphs, Chromatic equivalence classes of certain generalized polygon trees, A bibliography on chromatic polynomials, On \(q\)-graphs, On graphs whose flow polynomials have real roots only, Two chromatic polynomial conjectures, Hodge theory for combinatorial geometries, Chromaticity of chordal graphs, On the chromatic equivalence class of graphs, Chromatic properties of Hamiltonian graphs, On the unimodality of independence polynomials of some graphs, Hilbert polynomials in combinatorics, A dense set of chromatic roots which is closed under multiplication by positive integers, Order quasisymmetric functions distinguish rooted trees, Note on the subgraph component polynomial, Benjamini-Schramm continuity of root moments of graph polynomials, On chromatic coefficients, Two remarks on the adjoint polynomial, Chromatic polynomials for regular graphs and modified wheels, On the unimodality of independence polynomials of very well-covered graphs, Size of edge-critical uniquely 3-colorable planar graphs, Two classes of chromatically unique graphs, Divisibility of certain coefficients of the chromatic polynomials., On the enumeration of chains in regular chain-groups, Signed graph coloring, Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs, The chromaticity of wheels with a missing spoke, On maximally saturated graphs, Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles., Bivariate chromatic polynomials in computer algebra, On the differential polynomial of a graph, On the chromatic uniqueness of certain bipartite graphs, Algebraic properties of chromatic roots, Unimodular equivalence of graphs, Domination numbers and zeros of chromatic polynomials, The chromatic uniqueness of \(W_{10}\), The chromatic symmetric functions of trivially perfect graphs and cographs, Alliance polynomial of regular graphs, Weighted graph colorings, Maximization of the Choquet integral over a convex set and its application to resource allocation problems, On graphs having \(\sigma\)-polynomials of the same degree, On the absolute sum of chromatic polynomial coefficient of graphs, Weighted-set graph colorings, A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges, On uniquely 3-colorable graphs, Die chromatischen Polynome unterringfreier Graphen, On deterministic finite automata and syntactic monoid size, A little statistical mechanics for the graph theorist, Algorithm for deriving the chromatic polynomial of a graph, The interlace polynomial of a graph, An introduction to matching polynomials, Le nombre maximal de colorations d'un graphe Hamiltonien, Coefficient relationship between rook and chromatic polynomials, Stirling number identities from chromatic polynomials, Chromatic uniqueness of the generalized \(\Theta\)-graph, Chromaticity of self-complementary graphs, On \(\sigma\)-polynomials and a class of chromatically unique graphs, On unimodal sequences of graphical invariants, Chromatic polynomials of complements of bipartite graphs, Chromatically unique graphs, A characterization of chromatically rigid polynomials, The homology of the cyclic coloring complex of simple graphs, Chromatic coefficients of linear uniform hypergraphs, Expansions of the chromatic polynomial, Chromatic uniqueness of atoms in lattices of complete multipartite graphs, Proof of a chromatic polynomial conjecture, Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids, The computation of chromatic polynomials, All wheels with two missing consecutive spokes are chromatically unique, Chromatic polynomials of connected graphs, Catalan, Motzkin, and Riordan numbers, Chromatic polynomials of homeomorphism classes of graphs, The chromaticity of wheels, The search for chromatically unique graphs, On trees of polygons, The chromaticity of certain graphs with five triangles, Laplacian matrices of graphs: A survey, Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles, Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs, Integral-root polynomials and chromatic uniqueness of graphs, Farey Series and Maximal Outerplanar Graphs, The \(k\)-fractal of a simplicial complex, The dichromatic polynomial of a digraph, Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs, The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial, The average domination polynomial of graphs is unimodal, \(\sigma\)-polynomials and graph coloring, Zeros of rank-generating functions of Cohen-Macaulay complexes, Chromatic uniqueness of zero-divisor graphs, Another family of chromatically unique graphs, A categorification for the signed chromatic polynomial, Generalised chromatic polynomials of graphs from heaps of pieces, The chromaticity of wheels with a missing spoke. II, The odd-valued chromatic polynomial of a signed graph, On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs, One more remark on the adjoint polynomial, Chromaticity of series-parallel graphs, Several extreme coefficients of the Tutte polynomial of graphs, Unimodality of independence polynomials of the cycle cover product of graphs, An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\), Lagrangian geometry of matroids, On enumeration and entropy of ribbon tilings, Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations, Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II, On real-rootedness of independence polynomials of rooted products of graphs, \(p\)-adic roots of chromatic polynomials, Log-concavity of characteristic polynomials and the Bergman fan of matroids, CHROMATIC POLYNOMIALS OF n-CENTIPEDE AND TRIANGULAR SNAKE TSn GRAPHS, Unnamed Item, Chromatic polynomials of 2-edge-coloured graphs, The work of June Huh, MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling, Essence of independence: Hodge theory of matroids since June Huh, The amazing chromatic polynomial, Several improved asymptotic normality criteria and their applications to graph polynomials, Linear bounds on characteristic polynomials of matroids, A homomorphic polynomial for oriented graphs, A note on the four color theorem, On the independent domination polynomial of a graph, A note on the real part of complex chromatic roots, Necessary condition for a chromatic polynomial, q-plane zeros of the Potts partition function on diamond hierarchical graphs, An introduction to the k-defect polynomials, Chromatic equivalence classes of complete tripartite graphs, On the location of zeros of the Homfly polynomial, On the set of Hilbert polynomials, Number of cyclically irreducible words in the alphabet of a free group of finite rank, Galois groups of chromatic polynomials, On the Broken-Circuit Complex of Graphs, A maximal zero-free interval for chromatic polynomials of bipartite planar graphs, Zero-free intervals of chromatic polynomials of hypergraphs, Log-concavity of independence polynomials of some kinds of trees, EXACT PARTITION FUNCTION FOR THE POTTS MODEL WITH NEXT-NEAREST NEIGHBOR COUPLINGS ON ARBITRARY-LENGTH LADDERS, Preservation of log-concavity on summation, Expansions of Chromatic Polynomials and Log-Concavity, Graph theory, The behavior of Tutte polynomials of graphs under five graph operations and its applications, List coloring a Cartesian product with a complete bipartite factor, Problems on chromatic polynomials of hypergraphs, On the Roots of σ-Polynomials, Unimodality of independence polynomials of rooted products of graphs, On the number of forests and connected spanning subgraphs, CHROMATIC POLYNOMIALS OF K_{m}+P_{n}, K_{m}+C_{n} AND G\circ H, Chromatic polynomials of hypergraphs, A note on uniquely 3-colourable planar graphs, Recursion relations for chromatic coefficients for graphs and hypergraphs, Note on Turán's graph, A new subgraph expansion for obtaining coloring polynomials for graphs, Coefficients of chromatic polynomials, Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph), ALTERNATING COLOURINGS OF THE VERTICES OF A REGULAR POLYGON, Matroid Theory for Algebraic Geometers, DP color functions versus chromatic polynomials, Bijective Proofs of Proper Coloring Theorems, Chromatic polynomials of oriented graphs, Chromatic polynomials and logarithmic concavity, A note concerning chromatic polynomials, Characteristic vertices of trees*, Chromatic polynomial of intuitionistic fuzzy graphs using \(\left( \alpha, \beta\right)\)-levels, Characteristic vertices of trees*, A note on graph colouring, On a class of polynomials associated with the subgraphs of a graph and its application to chromatic and dichromatic polynomials, Unnamed Item, Chromatic polynomials and broken cycles, The maximum likelihood degree of a very affine variety, On the chromatic roots of generalized theta graphs, Note on chromatic polynomials of the threshold graphs, Log-Concavity of Combinations of Sequences and Applications to Genus Distributions, Colorings of the Graph K ᵐ 2 + Kn, On k-chromatically unique and k-chromatically equivalent hypergraphs, On chromatic polynomials of hypergraphs, Almost unimodal and real-rooted graph polynomials, On the unimodality of average edge cover polynomials, Chromatic polynomials of graphs from Kac-Moody algebras, Extremal bicyclic 3-chromatic graphs, The chromatic polynomial for cycle graphs
