About chromatic uniqueness of some complete tripartite graphs

DOI10.17377/semi.2017.14.129zbMath1430.05036arXiv1802.01082MaRDI QIDQ2285184

Pavel A. Gein

Publication date: 16 January 2020

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

Full work available at URL: https://arxiv.org/abs/1802.01082

zbMATH Keywords

chromatic polynomialchromatic uniquenesscomplete tripartite graph

Mathematics Subject Classification ID

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

Related Items (2)

ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS ⋮ On Garlands in \(\chi\)-uniquely colorable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
• The search for chromatically unique graphs
• On chromatic coefficients
• A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• The lattice of integer partitions
• 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\)

This page was built for publication: About chromatic uniqueness of some complete tripartite graphs