Chromaticity of the complements of paths and cycles

DOI10.1016/0012-365X(95)00308-JzbMath0870.05024MaRDI QIDQ1356659

Qingyan Du

Publication date: 7 July 1997

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

zbMATH Keywords

cyclepathchromatic uniquenesscomplementchromatically unique

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items

The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\) ⋮ On chromatic polynomials of some kinds of graphs ⋮ Adjoint polynomials of bridge-path and bridge-cycle graphs and Chebyshev polynomials ⋮ On the Roots of σ-Polynomials ⋮ On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization of quadratic and cubic \(\sigma\)-polynomials
• On maximally saturated graphs
• On \(\sigma\)-polynomials and a class of chromatically unique graphs
• \(\sigma\)-polynomials and graph coloring
• An introduction to chromatic polynomials
• On the theory of graphs