Classes of chromatically unique graphs (Q686445)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 428300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Classes of chromatically unique graphs |
scientific article; zbMATH DE number 428300 |
Statements
Classes of chromatically unique graphs (English)
0 references
4 January 1994
0 references
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.
0 references
chromatically unique graphs
0 references
