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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4 |
scientific article |
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
