On chromatic uniqueness of some complete tripartite graphs

DOI10.15826/UMJ.2021.1.004MaRDI QIDQ5155573zbMATH OpenOpenAlexFDO

Authors Pavel A. Gein

Publication date 7 October 2021

Published in Ural mathematical journal (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

chromatic equivalencechromatic polynomialchromatic uniquenesscomplete multipartite graphs

Mathematics Subject Classification ID

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

Recommendations

• About chromatic uniqueness of some complete tripartite graphs
• scientific article; zbMATH DE number 1501723
• scientific article; zbMATH DE number 5926171
• Chromatic uniqueness of a number of complete tripartite graphs
• Chromatic uniqueness of certain complete tripartite graphs

Cites work

• About chromatic uniqueness of complete tripartite graph K(s, s - 1, s - k), where k1 and s - k 2
• About chromatic uniqueness of some complete tripartite graphs
• Chromatic uniqueness of certain complete tripartite graphs
• Chromatic uniqueness of certain complete tripartite graphs. II
• Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
• scientific article; zbMATH DE number 2199828 (Why is no real title available?)
• On chromatic coefficients
• On Garlands in \(\chi\)-uniquely colorable graphs
• On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
• On the partition lattice of all integers
• The chromaticity of the complete t-partite graph K(1,p₂,,p_t)
• The lattice of integer partitions
• The search for chromatically unique graphs

Cited in

(17)

• About chromatic uniqueness of some complete tripartite graphs
• The chromatic equivalence class of \(K_{1, n, n + 2}\)
• scientific article; zbMATH DE number 5926171 (Why is no real title available?)
• scientific article; zbMATH DE number 6007676 (Why is no real title available?)
• 完全3部图K(n-k,n-3,n)色唯一性的证明
• Chromatic uniqueness of certain complete tripartite graphs. II
• Color sets of tripartite graphs
• Absolutely 3-chromatic graphs
• scientific article; zbMATH DE number 1501723 (Why is no real title available?)
• Some chromatic equivalence classes of complete multipartite graphs
• Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
• Chromatic uniqueness of a number of complete tripartite graphs
• On the chromaticity of the complete tripartite graphs K(n,n,n+4)
• Chromatic uniqueness of certain complete tripartite graphs
• Chromatic equivalence classes of complete tripartite graphs
• Chromatic equivalence classes of complete tripartite graphs
• Chromaticity of certain tripartite graphs identified with a path

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155573)