On \(\sigma\)-polynomials and a class of chromatically unique graphs

DOI10.1016/0012-365X(93)90485-CzbMath0774.05039MaRDI QIDQ1801695

Qingyan Du

Publication date: 20 June 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

upper boundchromatic numbersymmetric functionschromatic polynomialchromatically unique graphs

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Chromaticity of the complements of paths and cycles ⋮ The search for chromatically unique graphs. II ⋮ Adjoint polynomials and chromatically unique graphs ⋮ A bibliography on chromatic polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of quadratic and cubic \(\sigma\)-polynomials
• On \(\sigma\)-polynomials
• \(\sigma\)-polynomials and graph coloring
• An introduction to chromatic polynomials

This page was built for publication: On \(\sigma\)-polynomials and a class of chromatically unique graphs