An introduction to chromatic polynomials

DOI10.1016/S0021-9800(68)80087-0zbMath0173.26203MaRDI QIDQ5560915

Ronald C. Read

Publication date: 1967

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

topology

Related Items (only showing first 100 items - show all)

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

This page was built for publication: An introduction to chromatic polynomials