Chromatic uniqueness of the complements of certain forests (Q1366780): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The search for chromatically unique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4031916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2788040 / rank
 
Normal rank

Revision as of 18:51, 27 May 2024

scientific article
Language Label Description Also known as
English
Chromatic uniqueness of the complements of certain forests
scientific article

    Statements

    Chromatic uniqueness of the complements of certain forests (English)
    0 references
    0 references
    0 references
    0 references
    7 December 1997
    0 references
    A \(T\)-shape tree is a tree with the degree sequence \(\{ 1,1,1,2,2,\dots, 2,3\}\). By studying adjoint polynomials, the authors obtained the following result. There is a family \(\mathcal H\) of \(T\)-shape trees such that for each \(H \in {\mathcal H}\), if the complement of a graph \(G\) is a disjoint union of any number of copies of \(H\), then \(G\) is chromatically unique.
    0 references
    0 references
    chromatic unique
    0 references
    adjoint polynomial
    0 references
    chromatic polynomial
    0 references
    tree
    0 references