Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring

Henry Kierstead, A. V. Kostochka

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Fingerprint

Dive into the research topics of 'Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring'. Together they form a unique fingerprint.

Mathematics