Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring (Q2911051): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Henry A. Kierstead / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Alexandr V. Kostochka / rank | |||
Normal rank | |||
Revision as of 01:05, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring |
scientific article |
Statements
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring (English)
0 references
12 September 2012
0 references
equitable coloring
0 references
maximum degree
0 references
