About chromatic uniqueness of complete tripartite graph \(K(s, s - 1, s - k)\), where \(k\geq1\) and \(s - k\geq 2\)

DOI10.17377/semi.2016.13.027zbMath1341.05129MaRDI QIDQ2630541

Pavel A. Gein

Publication date: 28 July 2016

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

chromatic polynomialchromatic uniquenesscomplete tripartite graph

Mathematics Subject Classification ID

Graph polynomials (05C31)

Related Items

ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS, About chromatic uniqueness of some complete tripartite graphs