Chromatic Polynomials - MaRDI portal

Cited in

(82)

A survey of the asymptotic behaviour of maps
Limits of chromatic zeros of some families of maps
On the Birkhoff-Lewis equations
A new invariant of plane bipartite cubic graphs
An inequality for chromatic polynomials
A zero-free interval for chromatic polynomials
Is the four-color conjecture almost false?
Geometric coloring theory
A systematic approach to the determination of reducible configurations in the four-color conjecture
On the roots of chromatic polynomials
Catalan, Motzkin, and Riordan numbers
Subdivisions and chromatic roots
Classes of chromatically unique or equivalent graphs
The largest real zero of the chromatic polynomial
A bibliography on chromatic polynomials
Combinatorial map theory
The matrix of chromatic joins and the Temperley-Lieb algebra.
Problems related to type-\(A\) and type-\(B\) matrices of chromatic joins
On graphs whose flow polynomials have real roots only
Even subgraph expansions for the flow polynomial of cubic plane maps
On cycles in the sequence of unitary Cayley graphs
\(\sigma\)-polynomials and graph coloring
Counting pure \(k\)-cycles in sequences of Cayley graphs
Inapproximability of the Tutte polynomial of a planar graph
Zero-free intervals of chromatic polynomials of hypergraphs
Asymptotic behavior of acyclic and cyclic orientations of directed lattice graphs
DP color functions versus chromatic polynomials
A categorification for the signed chromatic polynomial
On zero-free intervals of flow polynomials
The maximum number of colorings of graphs of given order and size: a survey
On graphs having no flow roots in the interval \((1,2)\)
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs
A proof of Tomescu's graph coloring conjecture
Some array polynomials over special monoid presentations
A note on the permanental roots of bipartite graphs
On golden identities for constrained chromials
Regular major maps of at most 19 regions and their Q-chromials
Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings
The ratio of the numbers of odd and even cycles in outerplanar graphs
A homomorphic polynomial for oriented graphs
Chromatic roots and minor-closed families of graphs
A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings
On Tutte's chromatic invariant
Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
The number of colorings of planar graphs with no separating triangles
Polynomial Invariants of Graphs
Analysis approach to finite monoids
Expansions of Chromatic Polynomials and Log-Concavity
Modular Constructions for Combinatorial Geometries
A Zero-Free Interval for Chromatic Polynomials of Graphs
Density of Chromatic Roots in Minor-Closed Graph Families
Hyperbolic families and coloring graphs on surfaces
Chromatic bounds on orbital chromatic roots
Is the five-flow conjecture almost false?
Bijective proofs of proper coloring theorems
On the number of perfect matchings of generalized theta graphs and the edge cover polynomials of friendship graphs
CHROMATIC POLYNOMIALS AND BIALGEBRAS OF GRAPHS
ℱ-WORM colorings of some 2-trees: partition vectors
The Chromatic Polynomial of the Truncated Icosahedron
Boundary Values in the Four Color Problem
Boundary values in chromatic graph theory
On the foundations of combinatorial theory I. Theory of M�bius Functions
scientific article; zbMATH DE number 7593849 (Why is no real title available?)
Occurrences of reciprocal sign epistasis in single- and multi-peaked theoretical fitness landscapes
A generalized Beraha conjecture for non-planar graphs
An improved lower bound of P(G,L)-P(G,k) for k-assignments L
Upper bounds on the chromatic polynomial of a connected graph with fixed clique number
Approximating the chromatic polynomial is as hard as computing it exactly
Partition coefficients of acyclic graphs
Infinite log-convexity
Improved bounds for the zeros of the chromatic polynomial via Whitney's broken circuit theorem
Independence number and maximal chromatic polynomials of connected graphs
The Fortuin-Kasteleyn polynomial as a bialgebra morphism and applications to the Tutte polynomial
A generalization of chromatic polynomial of a graph subdivision
Independent domination polynomials of binary sequence graphs
Maximum number of colourings: 4-chromatic graphs
Chromatic zeros on hierarchical lattices and equidistribution on parameter space
The number of \(k\)-colorings of a graph on a fixed surface
A zero-free interval for flow polynomials of cubic graphs
Exponentially many 5-list-colorings of planar graphs
Two classes of chromatically unique graphs
On planar and non-planar graphs having no chromatic zeros in the interval(1,2)

This page was built for publication: Chromatic Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5839327)