An introduction to chromatic polynomials
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The homology of the cyclic coloring complex of simple graphs
- Zero-free regions for multivariate tutte polynomials (alias Potts-model partition functions) of graphs and matroids
- On trees of polygons
- On the chromatic uniqueness of bipartite graphs
- Chromatic sum equations for rooted cubic planar maps
- Chromatic polynomials and network reliability
- An application of the planar separator theorem to counting problems
- On \(\sigma\)-polynomials
- On chromatic coefficients
- Chromatic polynomials for regular graphs and modified wheels
- On the enumeration of chains in regular chain-groups
- Signed graph coloring
- On maximally saturated graphs
- On the chromatic uniqueness of certain bipartite graphs
- Unimodular equivalence of graphs
- The chromatic uniqueness of \(W_{10}\)
- On graphs having -polynomials of the same degree
- On uniquely 3-colorable graphs
- Die chromatischen Polynome unterringfreier Graphen
- Algorithm for deriving the chromatic 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 -graph
- Chromaticity of self-complementary graphs
- On unimodal sequences of graphical invariants
- Chromatically unique graphs
- Chromatic coefficients of linear uniform hypergraphs
- The computation of chromatic polynomials
- Catalan, Motzkin, and Riordan numbers
- Chromatic polynomials of homeomorphism classes of graphs
- 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
- Classes of chromatically equivalent graphs and polygon trees
- \(T\)-chromatic polynomials
- 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
- Decomposition of the flow polynomial
- A new method for proving chromatic uniqueness of graphs
- 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
- Two chromatic polynomial conjectures
- Chromaticity of chordal graphs
- On the chromatic equivalence class of graphs
- Hilbert polynomials in combinatorics
- Divisibility of certain coefficients of the chromatic polynomials.
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
- Proof of a chromatic polynomial conjecture
- All wheels with two missing consecutive spokes are chromatically unique
- Unimodality of independence polynomials of the incidence product of graphs
- On graphs whose flow polynomials have real roots only
- Hodge theory for combinatorial geometries
- Order quasisymmetric functions distinguish rooted trees
- On the unimodality of independence polynomials of very well-covered graphs
- Bivariate chromatic polynomials in computer algebra
- On the differential polynomial of a graph
- The chromatic symmetric functions of trivially perfect graphs and cographs
- Maximization of the Choquet integral over a convex set and its application to resource allocation problems
- On \(\sigma\)-polynomials and a class of chromatically unique graphs
- A characterization of chromatically rigid polynomials
- A note concerning chromatic polynomials
- Chromatic polynomials and broken cycles
- On the chromatic roots of generalized theta graphs
- The k-fractal of a simplicial complex
- \(\sigma\)-polynomials and graph coloring
- Zeros of rank-generating functions of Cohen-Macaulay complexes
- Another family of chromatically unique graphs
- The chromaticity of wheels with a missing spoke. II
- Chromaticity of series-parallel graphs
- Log-concavity of characteristic polynomials and the Bergman fan of matroids
- Necessary condition for a chromatic polynomial
- Zero-free intervals of chromatic polynomials of hypergraphs
- Log-concavity of independence polynomials of some kinds of trees
- On the number of forests and connected spanning subgraphs
- Recursion relations for chromatic coefficients for graphs and hypergraphs
- DP color functions versus chromatic polynomials
- Chromatic polynomial of intuitionistic fuzzy graphs using \(\left( \alpha, \beta\right)\)-levels
- Almost unimodal and real-rooted graph polynomials
- On the unimodality of average edge cover polynomials
- The dichromatic polynomial of a digraph
- A categorification for the signed chromatic polynomial
- Generalised chromatic polynomials of graphs from heaps of pieces
- The odd-valued chromatic polynomial of a signed graph
- Several extreme coefficients of the Tutte polynomial of graphs
- p-adic roots of chromatic polynomials
- On the independent domination polynomial of a graph
- The behavior of Tutte polynomials of graphs under five graph operations and its applications
- List coloring a Cartesian product with a complete bipartite factor
- Chromatic polynomials of oriented graphs
- Chromatic polynomials of graphs from Kac-Moody algebras
This page was built for publication: An introduction to chromatic polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5560915)
