On chromatic coefficients
From MaRDI portal
Cited in
(36)- On trees of polygons
- On the chromatic uniqueness of bipartite graphs
- On the chromatic uniqueness of certain bipartite graphs
- The chromatic uniqueness of \(W_{10}\)
- The computation of chromatic polynomials
- Classes of chromatically unique or equivalent graphs
- The chromaticity of certain graphs with five triangles
- Chromatic classes of 2-connected (n,n+3)-graphs with at least two triangles
- A bibliography on chromatic polynomials
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
- All wheels with two missing consecutive spokes are chromatically unique
- An algorithm which outputs a graph with a specified chromatic factor
- A characterization of chromatically rigid polynomials
- On cycles in the sequence of unitary Cayley graphs
- The chromaticity of wheels with a missing spoke. II
- Counting pure \(k\)-cycles in sequences of Cayley graphs
- About chromatic uniqueness of some complete tripartite graphs
- A note on the real part of complex chromatic roots
- The chromatic equivalence class of \(K_{1, n, n + 2}\)
- Several improved asymptotic normality criteria and their applications to graph polynomials
- On chromatic polynomials of hypergraphs
- Non-bipartite chromatic factors
- Lower central series and free resolutions of hyperplane arrangements
- Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
- Patterns in Khovanov link and chromatic graph homology
- Extremal Khovanov homology and the girth of a knot
- On chromatic uniqueness of some complete tripartite graphs
- scientific article; zbMATH DE number 7593849 (Why is no real title available?)
- Chromatic equivalence classes of complete tripartite graphs
- Chromatic polynomials of hypergraphs
- Classes of chromatically unique graphs
- Chromatic uniqueness of atoms in lattices of complete multipartite graphs
- The search for chromatically unique graphs
- Chromaticity of certain tripartite graphs identified with a path
- Two classes of chromatically unique graphs
- The chromaticity of wheels with a missing spoke
This page was built for publication: On chromatic coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144034)