Chromatic uniqueness of complete bipartite graphs with certain edges deleted. (Q2881258)
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 6021482
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chromatic uniqueness of complete bipartite graphs with certain edges deleted. |
scientific article; zbMATH DE number 6021482 |
Statements
3 April 2012
0 references
chromatic polynomial
0 references
chromatically unique
0 references
chromatically equivalent
0 references
0.97278464
0 references
0.9536585
0 references
0.9446579
0 references
0.94301075
0 references
0.9381205
0 references
0.9349442
0 references
0.9196243
0 references
Chromatic uniqueness of complete bipartite graphs with certain edges deleted. (English)
0 references
