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

zbMATH Open1156.05305MaRDI QIDQ5452897FDOQ5452897

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)

Cited In (4)

• Title not available (Why is that?)
• 完全3部图K(n-k,n-3,n)色唯一性的证明
• Conway-Gordon type theorem for the complete four-partite graph \(K_{3,3,1,1}\)
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• ON CHROMATIC UNIQUENESS OF SOME COMPLETE TRIPARTITE GRAPHS 👍 👎
• Title not available (Why is that?) 👍 👎
• Chromatic uniqueness of a kind of complete tripartite graph 👍 👎
• Title not available (Why is that?) 👍 👎

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)