Chromatic polynomials of connected graphs

DOI10.1007/BF01193920MaRDI QIDQ790846zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

characterization of subclasses of graphschromatic polynomial

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (05C99)

Recommendations

• Cutpoints and the chromatic polynomial
• scientific article; zbMATH DE number 568845
• scientific article; zbMATH DE number 3843776
• Extremal properties of the chromatic polynomials of connected 3-chromatic graphs
• scientific article; zbMATH DE number 3920500

Cites work

• An introduction to chromatic polynomials
• Cutpoints and the chromatic polynomial
• scientific article; zbMATH DE number 3843776 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)

Cited in

(22)

• On trees of polygons
• Chromatic polynomials and network reliability
• The chromatic connectivity of graphs
• Chromatic polynomials of generalized trees
• Chromatic and flow polynomials for directed graphs
• A bibliography on chromatic polynomials
• Divisibility of certain coefficients of the chromatic polynomials.
• A partition of connected graphs
• The chromatic polynomial of a digraph
• Connectedness of digraphs from quadratic polynomials
• Extremal properties of the chromatic polynomials of connected 3-chromatic graphs
• A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
• Cutpoints and the chromatic polynomial
• scientific article; zbMATH DE number 3920500 (Why is no real title available?)
• scientific article; zbMATH DE number 4051660 (Why is no real title available?)
• Chromaticity of triangulated graphs
• scientific article; zbMATH DE number 568845 (Why is no real title available?)
• Maximum chromatic polynomials of 2‐connected graphs
• scientific article; zbMATH DE number 1123787 (Why is no real title available?)
• scientific article; zbMATH DE number 833904 (Why is no real title available?)
• scientific article; zbMATH DE number 3319302 (Why is no real title available?)
• The search for chromatically unique 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)