On chromatic coefficients

DOI10.1016/0012-365X(80)90154-5zbMath0443.05041MaRDI QIDQ1144034

E. J. Farrell

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic polynomialcoefficients

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (36)

On the chromatic uniqueness of bipartite graphs ⋮ Lower central series and free resolutions of hyperplane arrangements ⋮ Extremal Khovanov homology and the girth of a knot ⋮ Chromaticity of certain tripartite graphs identified with a path ⋮ A bibliography on chromatic polynomials ⋮ The chromaticity of wheels with a missing spoke. II ⋮ Counting pure \(k\)-cycles in sequences of Cayley graphs ⋮ Non-bipartite chromatic factors ⋮ Unnamed Item ⋮ Several improved asymptotic normality criteria and their applications to graph polynomials ⋮ Two classes of chromatically unique graphs ⋮ Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs ⋮ The chromaticity of wheels with a missing spoke ⋮ Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. ⋮ A note on the real part of complex chromatic roots ⋮ An algorithm which outputs a graph with a specified chromatic factor ⋮ Chromatic equivalence classes of complete tripartite graphs ⋮ Patterns in Khovanov link and chromatic graph homology ⋮ On the chromatic uniqueness of certain bipartite graphs ⋮ ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS ⋮ The chromatic uniqueness of \(W_{10}\) ⋮ Classes of chromatically unique graphs ⋮ About chromatic uniqueness of some complete tripartite graphs ⋮ The chromatic equivalence class of \(K_{1, n, n + 2}\) ⋮ A characterization of chromatically rigid polynomials ⋮ Chromatic polynomials of hypergraphs ⋮ Chromatic uniqueness of atoms in lattices of complete multipartite graphs ⋮ On cycles in the sequence of unitary Cayley graphs ⋮ The computation of chromatic polynomials ⋮ All wheels with two missing consecutive spokes are chromatically unique ⋮ Classes of chromatically unique or equivalent graphs ⋮ The search for chromatically unique graphs ⋮ On trees of polygons ⋮ On chromatic polynomials of hypergraphs ⋮ The chromaticity of certain graphs with five triangles ⋮ Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles

Cites Work

• Coefficients of chromatic polynomials
• An introduction to chromatic polynomials

This page was built for publication: On chromatic coefficients