The chromatic uniqueness of complete bipartite graphs

DOI10.1016/0012-365X(91)90323-TzbMath0752.05031OpenAlexW2060132800MaRDI QIDQ1182979

Shao-Ji Xu

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90323-t

zbMATH Keywords

induced subgraphschromatic polynomialchromatic uniqueness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

The search for chromatically unique graphs. II, A bibliography on chromatic polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• On the chromatic uniqueness of bipartite graphs
• The maximal number of induced complete bipartite graphs
• On maximally saturated graphs
• Cutpoints and the chromatic polynomial
• The Maximum Number of Strongly Connected Subtournaments^*
• On cliques in graphs