Chromatically unique bipartite graphs with low 3-independent partition numbers

DOI10.1016/S0012-365X(00)00094-7MaRDI QIDQ1586760zbMATH OpenOpenAlexWikidataFDO

Authors F. M. Dong, K. M. Koh, K. L. Teo, C. H. C. Little, M. D. Hendy

Publication date 28 June 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00094-7

zbMATH Keywords

bipartite graphchromatically unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

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

Cited in

(2)

• Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
• Chromatically unique bipartite graphs with certain 3-independent partition numbers. II

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

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