Chromatic uniqueness of a kind of complete tripartite graph

MaRDI QIDQ2886593zbMATH OpenFDO

Authors Keyi Su, Xiang'en Chen

Publication date 1 June 2012

Published in Mathematics in Practice and Theory (Search for Journal in Brave)

zbMATH Keywords

chromatic polynomialchromatically unique graphcolor partitioncomplete tripartite graph

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 5926171
• Chromatic uniqueness of certain complete tripartite graphs
• scientific article; zbMATH DE number 1501723
• Chromatic uniqueness of a number of complete tripartite graphs

Cited in

(9)

• About chromatic uniqueness of some complete tripartite graphs
• About chromatic uniqueness of complete tripartite graph K(s, s - 1, s - k), where k1 and s - k 2
• scientific article; zbMATH DE number 5926171 (Why is no real title available?)
• 完全3部图K(n-k,n-3,n)色唯一性的证明
• Chromatic uniqueness of complete t-partite graphs K(n-k,n,, n)
• scientific article; zbMATH DE number 38309 (Why is no real title available?)
• Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
• On the chromaticity of the complete tripartite graphs K(n,n,n+4)
• Chromatic uniqueness of certain complete tripartite graphs

This page was built for publication: Chromatic uniqueness of a kind of complete tripartite graph

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