ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS

DOI10.15826/umj.2021.1.004zbMath1473.05088OpenAlexW3191050102MaRDI QIDQ5155573

Pavel A. Gein

Publication date: 7 October 2021

Published in: Ural Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/umj136

zbMATH Keywords

chromatic polynomialchromatic uniquenesscomplete multipartite graphschromatic equivalence

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
• The search for chromatically unique graphs
• On chromatic coefficients
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• The lattice of integer partitions
• On Garlands in \(\chi\)-uniquely colorable graphs
• About chromatic uniqueness of some complete tripartite graphs
• On the partition lattice of all integers
• About chromatic uniqueness of complete tripartite graph \(K(s, s - 1, s - k)\), where \(k\geq1\) and \(s - k\geq 2\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS