Chromatically unique bipartite graphs with certain 3-independent partition numbers. II

MaRDI QIDQ2469367zbMATH OpenFDO

Authors Roslan Hasni, Y. H. Peng

Publication date 5 February 2008

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/54128

zbMATH Keywords

chromatic polynomialchromatic uniquenesschromatic equivalence

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chromatically unique bipartite graphs with low 3-independent partition numbers
• Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
• scientific article; zbMATH DE number 5809759
• Chromatic uniqueness of complete bipartite graphs with certain edges delected. II
• On the chromatic uniqueness of certain bipartite graphs

Cited in

(3)

• Chromatically unique bipartite graphs with low 3-independent partition numbers
• Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
• Distinguishing chromatic numbers of bipartite graphs

This page was built for publication: Chromatically unique bipartite graphs with certain 3-independent partition numbers. II

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