The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than -4

DOI10.1016/J.DISC.2006.10.020MaRDI QIDQ952643zbMATH OpenOpenAlexFDO

Authors Haicheng Ma, Haizhen Ren

Publication date 12 November 2008

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.10.020

zbMATH Keywords

chromatic polynomialchromatically equivalentadjoint polynomialchromatically unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chromatically equivalent class of certain graphs with integral-root polynomials
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• Publication:3513625
• The factorization theorem of adjoint polynomials of a kind of graph and chromatically equivalence of its complement
• Publication:3513811
• Publication:3641849
• The factorizations of adjoint polynomials of graphs of shape as \(P_\lambda^{ES}\) and chromatically equivalence of their complements
• On extremes of minimum real roots of adjoint polynomials of graphs with \(R(G)\geq -1\)
• The factorization of adjoint polynomials of \(E^{G (i)}\)-class graphs and chromatically equivalence analysis
• Factorizations of adjoint polynomials of graphs of shape \({P^{S{G_\lambda}}}\) and chromatically equivalence of their complements

Cites work

• scientific article; zbMATH DE number 434905 (Why is no real title available?)
• scientific article; zbMATH DE number 4091530 (Why is no real title available?)
• scientific article; zbMATH DE number 1187354 (Why is no real title available?)
• scientific article; zbMATH DE number 1153017 (Why is no real title available?)
• A new method for proving chromatic uniqueness of graphs
• Adjoint polynomials and chromatically unique graphs
• Chromaticity of some families of dense graphs
• Chromaticity of the complements of paths and cycles
• Graphs with chromatic polynomial \(\sum_{l\leqslant m_0}\binom l{m_0-l} (\lambda)_l\)
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• The partition polynomial of a finite set system
• \(\sigma\)-polynomials and graph coloring

Cited in

(8)

• The relation on the coefficients and roots of adjoint polynomial and its application
• A complete solution to the chromatic equivalence class of graph \(\overline{B_{n-8,1,4}}\)
• On the roots of \(\sigma\)-polynomials
• The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots
• A sufficient and necessary condition for the chromatic equivalence of a class of graphs
• scientific article; zbMATH DE number 5631132 (Why is no real title available?)
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• On the minimum roots of the adjoint polynomials of unicyclic graphs

This page was built for publication: The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\)

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