The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4 (Q514702)
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: The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4 |
scientific article; zbMATH DE number 6693424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4 |
scientific article; zbMATH DE number 6693424 |
Statements
The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4 (English)
0 references
9 March 2017
0 references
equitable coloring
0 references
equitable chromatic threshold
0 references
Cartesian product
0 references
bipartite graph
0 references
0.8984895348548889
0 references
0.8929029703140259
0 references
0.8910254240036011
0 references
0.8762592673301697
0 references
0.8738704323768616
0 references
