Some families of chromatically unique bipartite graphs

DOI10.1016/S0012-365X(97)00203-3zbMath0958.05054OpenAlexW2006170146MaRDI QIDQ1584227

Xie-Bin Chen

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00203-3

zbMATH Keywords

chromatic polynomialchromaticitychromatically unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The search for chromatically unique graphs
• On the chromatic uniqueness of certain bipartite graphs
• Parallel concepts in graph theory
• The search for chromatically unique graphs. II
• The chromaticity of complete bipartite graphs with at most one edge deleted
• On chromatic equivalence of graphs
• Unnamed Item

This page was built for publication: Some families of chromatically unique bipartite graphs