Chromatic uniqueness of a kind of complete tripartite graph

zbMATH Open1249.05140MaRDI QIDQ2886593

Xiang'en Chen, Keyi Su

Publication date: 1 June 2012

Published in: Mathematics in Practice and Theory (Search for Journal in Brave)

zbMATH Keywords

chromatic polynomialcomplete tripartite graphchromatically unique graphcolor partition

Mathematics Subject Classification ID

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

Related Items (5)

Title not available (Why is that?) ⋮ Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs ⋮ Chromatic uniqueness of certain complete tripartite graphs ⋮ About chromatic uniqueness of some complete tripartite graphs ⋮ 完全3部图K(n-k,n-3,n)色唯一性的证明

This page was built for publication: Chromatic uniqueness of a kind of complete tripartite graph

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