The chromaticity of complete bipartite graphs with at most one edge deleted (Q3496353)
From MaRDI portal
!
WARNING
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 4170932
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The chromaticity of complete bipartite graphs with at most one edge deleted |
scientific article; zbMATH DE number 4170932 |
Statements
The chromaticity of complete bipartite graphs with at most one edge deleted (English)
0 references
1990
0 references
chromatic polynomials
0 references
bipartitie graphs
0 references
chromatically unique
0 references
0.9022282361984252
0 references
0.9004721641540527
0 references
