The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\)
From MaRDI portal
Publication:952643
DOI10.1016/j.disc.2006.10.020zbMath1161.05034MaRDI QIDQ952643
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
05C15: Coloring of graphs and hypergraphs
Related Items
Cites Work
- The partition polynomial of a finite set system
- Chromaticity of the complements of paths and cycles
- A new method for proving chromatic uniqueness of graphs
- Adjoint polynomials and chromatically unique graphs
- On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
- Chromaticity of some families of dense graphs
- Graphs with chromatic polynomial \(\sum_{l\leqslant m_0}\binom l{m_0-l} (\lambda)_l\)
- \(\sigma\)-polynomials and graph coloring
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item