Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton (Q801930)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton |
scientific article; zbMATH DE number 3880739
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton |
scientific article; zbMATH DE number 3880739 |
Statements
Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton (English)
0 references
1984
0 references
See the preview in Zbl 0539.05032.
0 references
(n:i)-chromatic number
0 references
