On the equitable chromatic number of complete \(n\)-partite graphs (Q5951975): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Equitable and proportional coloring of trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equitable coloring and the maximum degree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5620621 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On equitable coloring of bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Equitable Coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4348809 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4255998 / rank | |||
Normal rank | |||
Revision as of 22:05, 3 June 2024
scientific article; zbMATH DE number 1687501
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the equitable chromatic number of complete \(n\)-partite graphs |
scientific article; zbMATH DE number 1687501 |
Statements
On the equitable chromatic number of complete \(n\)-partite graphs (English)
0 references
14 August 2002
0 references
equitable chromatic number
0 references
