Classes of chromatically unique graphs

DOI10.1016/0012-365X(93)90142-GMaRDI QIDQ686445zbMATH OpenOpenAlexFDO

Authors Mieczysław Borowiecki, Ewa Drgas-Burchardt

Publication date 4 January 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90142-g

zbMATH Keywords

chromatically unique graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Review text

The authors show that for every \(n \geq 3\), the graph \(K_{n,n}-rK_ 2\) with \(0 \leq r \leq n\), is chromatically unique.

Cites work

• Chromatically unique graphs
• Cutpoints and the chromatic polynomial
• On chromatic coefficients
• On the chromatic uniqueness of bipartite graphs
• Parallel concepts in graph theory
• The chromaticity of wheels with a missing spoke
• Two classes of chromatically unique graphs

Cited in

(8)

• On the chromaticity of complete multipartite graphs with certain edges added
• Classes of chromatically unique or equivalent graphs
• Chromatic uniqueness in a family of 2-connected graphs
• The search for chromatically unique graphs. II
• A bibliography on chromatic polynomials
• Uniquely n-colorable and chromatically equivalent graphs
• Two new classes of chromatically unique graphs
• ON UNIQUELY -G k-COLOURABLE GRAPHS

This page was built for publication: Classes of chromatically unique graphs

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