Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring (Q2911051)
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: Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring |
scientific article; zbMATH DE number 6081427
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring |
scientific article; zbMATH DE number 6081427 |
Statements
12 September 2012
0 references
equitable coloring
0 references
maximum degree
0 references
0.87284994
0 references
0.8689251
0 references
0.8650222
0 references
0.8618976
0 references
0.8617075
0 references
0.86061156
0 references
0.86020106
0 references
0.8592106
0 references
Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring (English)
0 references
