scientific article; zbMATH DE number 861338

MaRDI QIDQ4871063zbMATH OpenFDO

Authors

Publication date 28 March 1996

zbMATH Keywords

chromatic coefficientschromatic polynomialcolorcoloringsplanar graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• Minimal coloring and strength of graphs
• scientific article; zbMATH DE number 810478
• Critically and minimally cochromatic graphs
• Approximation results for the minimum graph coloring problem
• Total colorings of graphs with minimum sum of colors
• scientific article; zbMATH DE number 3308988
• Minimum chromaticity of circulant graphs
• Some results on total chromatic number of a graph
• The n-minimal chromatic multiplicity of a graph
• Minimum order of graphs with given coloring parameters

Cited in

(7)

• Chromatic polynomials with least coefficients
• Planar graphs with least chromatic coefficients
• Minimax relations for the partial q-colorings of a graph
• Minimal colorings for properly colored subgraphs
• The n-minimal chromatic multiplicity of a graph
• scientific article; zbMATH DE number 19171 (Why is no real title available?)
• scientific article; zbMATH DE number 3205929 (Why is no real title available?)

This page was built for publication:

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