Classes of chromatically unique graphs
From MaRDI portal
Publication:686445
DOI10.1016/0012-365X(93)90142-GzbMATH Open0788.05040OpenAlexW2015226236MaRDI QIDQ686445FDOQ686445
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
Cites Work
Cited In (8)
- A bibliography on chromatic polynomials
- ON UNIQUELY -G k-COLOURABLE GRAPHS
- Classes of chromatically unique or equivalent graphs
- Uniquely \(n\)-colorable and chromatically equivalent graphs
- On the chromaticity of complete multipartite graphs with certain edges added
- Two new classes of chromatically unique graphs
- Chromatic uniqueness in a family of 2-connected graphs
- The search for chromatically unique graphs. II
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)