scientific article; zbMATH DE number 5926171

DOI10.3770/J.ISSN:1000-341X.2010.02.005MaRDI QIDQ3014375zbMATH OpenFDO

Authors Keyi Su, Xiang'en Chen

Publication date 19 July 2011

zbMATH Keywords

chromatic polynomialcomplete tripartite graphchromatic uniquenesscolor partition

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On chromatic uniqueness of some complete tripartite graphs
• A note on chromatic uniqueness of certain complete tripartite graphs.
• About chromatic uniqueness of some complete tripartite graphs
• scientific article; zbMATH DE number 5670499
• Chromatic uniqueness of certain complete tripartite graphs
• Chromatic uniqueness of certain complete tripartite graphs
• Chromatic uniqueness of a number of complete tripartite graphs
• Chromatic uniqueness of a kind of complete tripartite graph
• Chromatic uniqueness of certain complete tripartite graphs. II
• A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs

Cited in

(9)

• Chromatic uniqueness of a kind of complete tripartite graph
• Improvement of the numerical condition of chromaticity on complete tripartite graphs
• 完全3部图K(n-k,n-3,n)色唯一性的证明
• A note on chromatic uniqueness of certain complete tripartite graphs.
• Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs
• Chromatic uniqueness of certain complete tripartite graphs
• The chromatic equivalence class of \(K_{1, n, n + 2}\)
• On chromatic uniqueness of some complete tripartite graphs
• About chromatic uniqueness of some complete tripartite graphs

This page was built for publication:

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