Chromatic uniqueness of certain complete 4-partite graphs.

MaRDI QIDQ2918635zbMATH OpenFDO

Authors G. C. Lau, Y. H. Peng, H. H. Chu

Publication date 8 October 2012

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

chromatic polynomialchromatic uniquenesscomplete 4-partite graph

Mathematics Subject Classification ID

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

Recommendations

• Chromatic uniqueness of certain complete tripartite graphs
• About chromatic uniqueness of some complete tripartite graphs
• Chromatic uniqueness of a number of complete tripartite graphs
• Chromatic uniqueness of certain complete t-partite graphs
• About chromatic uniqueness of complete tripartite graph K(s, s - 1, s - k), where k1 and s - k 2

Cited in

(3)

• Chromatic uniqueness of certain complete t-partite graphs
• Chromatic uniqueness of complete t-partite graphs K(n-k,n,, n)
• scientific article; zbMATH DE number 27256 (Why is no real title available?)

This page was built for publication: Chromatic uniqueness of certain complete 4-partite graphs.

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