ISSN 0253-2778

CN 34-1054/N

open

Proof of chromaticity of the complete tripartite graphs K(n-k,n-3,n)

    Abstract
  • Let P(G, λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P(H, λ)=P(G, λ) implies G≌H.
    • FullText(HTML)
  • loading
    • References (0)
    • Related Articles
  • Track Citations

Catalog

    Get Citation
    {{if article.pdfAccess}}
    {{if article.articleBusiness.pdfLink && article.articleBusiness.pdfLink != ''}} {{else}} {{/if}}PDF
    {{/if}}
    XML
    TrendMD

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return