The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\) (Q952643): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.10.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987520239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromaticity of some families of dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromaticity of the complements of paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\sigma\)-polynomials and graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjoint polynomials and chromatically unique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for proving chromatic uniqueness of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition polynomial of a finite set system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with chromatic polynomial \(\sum_{l\leqslant m_0}\binom l{m_0-l} (\lambda)_l\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs / rank
 
Normal rank

Latest revision as of 20:13, 28 June 2024

scientific article
Language Label Description Also known as
English
The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\)
scientific article

    Statements

    The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\) (English)
    0 references
    0 references
    0 references
    12 November 2008
    0 references
    0 references
    chromatic polynomial
    0 references
    adjoint polynomial
    0 references
    chromatically equivalent
    0 references
    chromatically unique
    0 references
    0 references