"Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring."

Henry A. Kierstead, Alexandr V. Kostochka (2012)

> Home

Details and statistics

DOI: 10.1002/JGT.20630

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/KiersteadK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/KiersteadK12
Henry A. Kierstead, Alexandr V. Kostochka:
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring. J. Graph Theory 71(1): 31-48 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.