Adjoint polynomials and chromatically unique graphs (Q1366781): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic equivalence of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\sigma\)-polynomials and a class of chromatically unique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to matching polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The search for chromatically unique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\sigma\)-polynomials and graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of chromatically unique graphs having quadratic σ‐polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs having \(\sigma\)-polynomials of the same degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2715277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4031916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2788040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4216396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2841527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to chromatic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\sigma\)-polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682505 / rank
 
Normal rank

Revision as of 18:51, 27 May 2024

scientific article
Language Label Description Also known as
English
Adjoint polynomials and chromatically unique graphs
scientific article

    Statements

    Adjoint polynomials and chromatically unique graphs (English)
    0 references
    0 references
    7 December 1997
    0 references
    This paper surveys some results about chromatically unique graphs obtained studying their adjoint polynomials.
    0 references
    0 references
    chromatic unique
    0 references
    adjoint polynomial
    0 references
    chromatic polynomial
    0 references