Chromatic polynomials of connected graphs
From MaRDI portal
Publication:790846
DOI10.1007/BF01193920zbMATH Open0535.05053OpenAlexW1985792286MaRDI QIDQ790846FDOQ790846
Authors: Chong-Yun Chao, Lianchang Zhao 
Publication date: 1984
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01193920
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph theory (05C99)
Cites Work
Cited In (21)
- Chromatic polynomials and network reliability
- A partition of connected graphs
- Title not available (Why is that?)
- A bibliography on chromatic polynomials
- Divisibility of certain coefficients of the chromatic polynomials.
- Extremal properties of the chromatic polynomials of connected 3-chromatic graphs
- On trees of polygons
- Chromatic polynomials of generalized trees
- Connectedness of digraphs from quadratic polynomials
- A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
- Maximum chromatic polynomials of 2‐connected graphs
- The search for chromatically unique graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The chromatic connectivity of graphs
- Title not available (Why is that?)
- Cutpoints and the chromatic polynomial
- Chromaticity of triangulated graphs
- Title not available (Why is that?)
- Chromatic and flow polynomials for directed graphs
- The chromatic polynomial of a digraph
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)
