The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4 (Q514702): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.11650/TJM.18.2014.3645 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.11650/TJM.18.2014.3645 / rank | |||
Normal rank | |||
Latest revision as of 20:00, 9 December 2024
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
