On the chromaticity of the complete tripartite graphs K(n,n,n+4)

MaRDI QIDQ5452897zbMATH OpenFDO

Authors H. M. Liu

Publication date 4 April 2008

zbMATH Keywords

chromatic polynomialbipartite graphscomplete tripartite graphchromatically unique

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 38309
• On chromatic uniqueness of some complete tripartite graphs
• scientific article; zbMATH DE number 1501723
• Chromatic uniqueness of a kind of complete tripartite graph
• A note on chromatic uniqueness of certain complete tripartite graphs.

Cited in

(5)

• scientific article; zbMATH DE number 1916557 (Why is no real title available?)
• 完全3部图K(n-k,n-3,n)色唯一性的证明
• Chaotic numbers of complete bipartite graphs and tripartite graphs
• Conway-Gordon type theorem for the complete four-partite graph \(K_{3,3,1,1}\)
• scientific article; zbMATH DE number 5038489 (Why is no real title available?)

This page was built for publication: On the chromaticity of the complete tripartite graphs \(K(n,n,n+4)\)

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