ISSN 0253-2778

CN 34-1054/N

open
Free to Publish. Free to Read.
Open AccessOpen Access JUSTC

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

Cite this:
https://doi.org/10.3969/j.issn.0253-2778.2019.05.004
More Information
  • Author Bio:

    XU Limin, male, born in 1961, master/Prof. Research field: Graphs and combinatorics. E-mail: xulimina@126.com

  • Corresponding author: YANG Zhilin
  • Received Date: 10 April 2018
  • Rev Recd Date: 30 December 2018
  • Publish Date: 31 May 2019
    Abstract

  • 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.

    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)
    • Supplements(0)
    • Related Articles
    • Track Citations
  • 加载中

Catalog

    |
    Get Citation
    PDF
    XML
    Recommended articles
    TrendMD
    Volume 49 Issue 5 page: 377-381
    Cover

    Article Metrics

    Article views (51) PDF downloads(121)
    Proportional views

    Copyright © Editorial Office of JUSTC, All Rights Reserved. 皖ICP备05002528号

    Supported by: Beijing Renhe Information Technology Co. Ltd    

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return