Chromatic uniqueness of certain complete tripartite graphs

DOI10.1007/s10114-011-8507-2zbMath1222.05068OpenAlexW1602194684WikidataQ126529173 ScholiaQ126529173MaRDI QIDQ546338

Yee-Hock Peng, G. C. Lau

Publication date: 24 June 2011

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-011-8507-2

zbMATH Keywords

chromatic polynomialchromatic uniquenesscomplete tripartit graphs

Mathematics Subject Classification ID

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

Related Items (1)

The chromatic equivalence class of \(K_{1, n, n + 2}\)

This page was built for publication: Chromatic uniqueness of certain complete tripartite graphs