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.020zbMATH Open1161.05034OpenAlexW1987520239MaRDI QIDQ952643FDOQ952643

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

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
• scientific article
• The factorization theorem of adjoint polynomials of a kind of graph and chromatically equivalence of its complement
• scientific article
• scientific article; zbMATH DE number 5631132
• 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

zbMATH Keywords

chromatic polynomialchromatically equivalentadjoint polynomialchromatically unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• \(\sigma\)-polynomials and graph coloring
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• Chromaticity of some families of dense graphs
• A new method for proving chromatic uniqueness of graphs
• Adjoint polynomials and chromatically unique graphs
• Graphs with chromatic polynomial \(\sum_{l\leqslant m_0}\binom l{m_0-l} (\lambda)_l\)
• Title not available (Why is that?)
• Chromaticity of the complements of paths and cycles
• The partition polynomial of a finite set system
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• A complete solution to the chromatic equivalence class of graph \(\overline{B_{n-8,1,4}}\)
• 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
• On the roots of \(\sigma\)-polynomials
• The relation on the coefficients and roots of adjoint polynomial and its application
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• Title not available (Why is that?)
• 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)