Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs

DOI10.1134/S0081543812090015zbMath1301.05117MaRDI QIDQ461058

J. Herrera, D. Rodríguez-Gómez

Publication date: 9 October 2014

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

latticechromatic polynomialchromatic uniquenesscomplete multipartite graphinteger partition

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorial aspects of partitions of integers (05A17) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS ⋮ On Garlands in \(\chi\)-uniquely colorable graphs ⋮ About chromatic uniqueness of some complete tripartite graphs

Cites Work

• Unnamed Item
• The search for chromatically unique graphs
• The lattice of partitions of a positive integer
• On chromatic coefficients
• On maximally saturated graphs
• An introduction to chromatic polynomials

This page was built for publication: Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs