Adjoint polynomials and chromatically unique graphs

DOI10.1016/S0012-365X(96)00271-3zbMath0878.05030OpenAlexW2016483748MaRDI QIDQ1366781

Ru-Ying Liu

Publication date: 7 December 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00271-3

zbMATH Keywords

chromatic polynomialadjoint polynomialchromatic unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

The search for chromatically unique graphs. II, A bibliography on chromatic polynomials, The roots of \(\sigma\)-polynomials, A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\), The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\), On problems and conjectures on adjointly equivalent graphs, On the Roots of σ-Polynomials, On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs, On the minimum real roots of the adjoint polynomial of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The search for chromatically unique graphs
• On \(\sigma\)-polynomials
• On graphs having \(\sigma\)-polynomials of the same degree
• An introduction to matching polynomials
• On \(\sigma\)-polynomials and a class of chromatically unique graphs
• \(\sigma\)-polynomials and graph coloring
• On chromatic equivalence of graphs
• Classification of chromatically unique graphs having quadratic σ‐polynomials
• An introduction to chromatic polynomials