Concerning the achromatic number of graphs (Q1065819)
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 3922682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Concerning the achromatic number of graphs |
scientific article; zbMATH DE number 3922682 |
Statements
Concerning the achromatic number of graphs (English)
0 references
1986
0 references
See the preview in Zbl 0554.05028.
0 references
achromatic number
0 references
computational complexity
0 references
NP-completeness
0 references
bipartite graphs
0 references
polynomial algorithms
0 references
trees
0 references
upper bounds
0 references
