ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS
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\simeq H\) for every \(H\) chromatically equivalent to \(G\). In this paper, the chromatic uniquene...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin.
2021-07-01
|
| Series: | Ural Mathematical Journal |
| Subjects: | |
| Online Access: | https://umjuran.ru/index.php/umj/article/view/347 |