We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
Ural Federal University named after the first President of Russia B.N. Yeltsin
Doi
Abstract
Let P(G,x) be a chromatic polynomial of a graph G. Two graphs G and H are called chromatically equivalent iff P(G,x)=H(G,x). A graph G is called chromatically unique if G≃H for every H chromatically equivalent to G. In this paper, the chromatic uniqueness of complete tripartite graphs K(n1,n2,n3) is proved for n1⩾n2⩾n3⩾2 and n1−n3⩽5.The author is grateful to his scientific advisor prof. V. A. Baransky for constant attention and remarks
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.