Adjoint polynomials and chromatically unique graphs

DOI10.1016/S0012-365X(96)00271-3MaRDI QIDQ1366781zbMATH OpenOpenAlexFDO

Authors 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

adjoint polynomialchromatic polynomialchromatic unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Review text

This paper surveys some results about chromatically unique graphs obtained studying their adjoint polynomials.

Cites work

• \(\sigma\)-polynomials and graph coloring
• An introduction to chromatic polynomials
• An introduction to matching polynomials
• Chromatic polynomials of complementary graphs of trees.
• Chromatic uniqueness of a class of graphs
• Classification of chromatically unique graphs having quadratic σ‐polynomials
• Graph theory with applications
• scientific article; zbMATH DE number 3904612 (Why is no real title available?)
• scientific article; zbMATH DE number 151783 (Why is no real title available?)
• scientific article; zbMATH DE number 1214963 (Why is no real title available?)
• scientific article; zbMATH DE number 1094005 (Why is no real title available?)
• scientific article; zbMATH DE number 1153017 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• On \(\sigma\)-polynomials
• On \(\sigma\)-polynomials and a class of chromatically unique graphs
• On chromatic equivalence of graphs
• On graphs having -polynomials of the same degree
• The search for chromatically unique graphs
• Two new classes of chromatically unique graphs

Cited in

(10)

• On the minimum real roots of the adjoint polynomial of a graph
• The search for chromatically unique graphs. II
• New families of adjointly unique graphs
• A bibliography on chromatic polynomials
• The roots of -polynomials
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• On the roots of -polynomials
• On problems and conjectures on adjointly equivalent graphs
• 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

This page was built for publication: Adjoint polynomials and chromatically unique graphs

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