Recommendations
Cites work
Cited in
(21)- Chromatic polynomials and network reliability
- Maximum chromatic polynomials of 2‐connected graphs
- Cutpoints and the chromatic polynomial
- Chromaticity of triangulated graphs
- scientific article; zbMATH DE number 3920500 (Why is no real title available?)
- scientific article; zbMATH DE number 3319302 (Why is no real title available?)
- A partition of connected graphs
- A bibliography on chromatic polynomials
- Extremal properties of the chromatic polynomials of connected 3-chromatic graphs
- On trees of polygons
- A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
- The search for chromatically unique graphs
- The chromatic connectivity of graphs
- scientific article; zbMATH DE number 4051660 (Why is no real title available?)
- The chromatic polynomial of a digraph
- scientific article; zbMATH DE number 1123787 (Why is no real title available?)
- scientific article; zbMATH DE number 833904 (Why is no real title available?)
- Divisibility of certain coefficients of the chromatic polynomials.
- Chromatic polynomials of generalized trees
- Connectedness of digraphs from quadratic polynomials
- Chromatic and flow polynomials for directed graphs
This page was built for publication: Chromatic polynomials of connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790846)