Chromatic uniqueness of certain bipartite graphs with six edges deleted

MaRDI QIDQ2996648zbMATH OpenFDO

Authors Y. H. Peng, H. Roslan

Publication date 3 May 2011

zbMATH Keywords

bipartite graphchromatic polynomialchromatic uniqueness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 5759616
• Chromaticity of certain bipartite graph with five edges deleted
• Chromaticity of bipartite graphs with seven edges deleted.
• scientific article; zbMATH DE number 5809759
• Chromatic uniqueness of complete bipartite graphs with certain edges deleted.

Cited in

(8)

• Chromatic uniqueness of complete bipartite graphs with certain edges delected. II
• Chromaticity of certain bipartite graph with five edges deleted
• Chromaticity of bipartite graphs with seven edges deleted.
• scientific article; zbMATH DE number 3985252 (Why is no real title available?)
• The chromatic uniqueness of 6-bridge graphs
• scientific article; zbMATH DE number 5759616 (Why is no real title available?)
• Chromatic uniqueness of complete bipartite graphs with certain edges deleted.
• The distinguishing chromatic number of bipartite graphs of girth at least six

This page was built for publication: Chromatic uniqueness of certain bipartite graphs with six edges deleted

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