Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring (Q2911051): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1002/jgt.20630 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1487816497 / rank | |||
Normal rank |
Revision as of 21:54, 19 March 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