A note on chromatic uniqueness of certain complete tripartite graphs.

MaRDI QIDQ4924894zbMATH OpenFDO

Authors Xiang'en Chen, Keyi Su, Bing Yao

Publication date 10 June 2013

zbMATH Keywords

chromatic polynomialchromatic uniquenesschromatically unique graphcomplete tripartite graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

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

Cited in

(10)

• About chromatic uniqueness of some complete tripartite graphs
• scientific article; zbMATH DE number 5926171 (Why is no real title available?)
• Chromatic uniqueness of certain complete tripartite graphs
• scientific article; zbMATH DE number 742642 (Why is no real title available?)
• scientific article; zbMATH DE number 1501723 (Why is no real title available?)
• scientific article; zbMATH DE number 2119970 (Why is no real title available?)
• Improvement of the numerical condition of chromaticity on complete tripartite graphs
• On the chromaticity of the complete tripartite graphs K(n,n,n+4)
• Chromatic uniqueness of certain complete tripartite graphs
• The chromaticity of certain complete multipartite graphs

This page was built for publication: A note on chromatic uniqueness of certain complete tripartite graphs.

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