Chromatic uniqueness of certain bipartite graphs with six edges deleted

zbMATH Open1219.05059MaRDI QIDQ2996648FDOQ2996648

Authors: Y. H. Peng, H. Roslan 

Publication date: 3 May 2011

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.

zbMATH Keywords

bipartite graphchromatic polynomialchromatic uniqueness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (8)

• Chromatic uniqueness of complete bipartite graphs with certain edges delected. II
• Chromaticity of certain bipartite graph with five edges deleted
• Title not available (Why is that?)
• Chromaticity of bipartite graphs with seven edges deleted.
• The chromatic uniqueness of 6-bridge graphs
• The distinguishing chromatic number of bipartite graphs of girth at least six
• Title not available (Why is that?)
• Chromatic uniqueness of complete bipartite graphs with certain edges deleted.

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)