The pseudoachromatic number of a graph (Q1586845)
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 1533402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The pseudoachromatic number of a graph |
scientific article; zbMATH DE number 1533402 |
Statements
The pseudoachromatic number of a graph (English)
0 references
19 March 2001
0 references
The pseudoachromatic number of a graph \(G\) is the maximum size of a vertex partition of \(G\) (where the sets of the partition may or may not be independent) such that, between any two distinct parts, there is at least one edge of \(G\). In this paper this new parameter is determined for cycles, paths, wheels and certain complete multipartite graphs. Some open problems are raised.
0 references
pseudoachromatic number
0 references
achromatic number
0 references
chromatic number
0 references
pseudocomplete coloring
0 references
0 references
0.9391416
0 references
0.92106515
0 references
0.9138974
0 references
0.91256607
0 references
0.9068201
0 references
0 references
