Equitable coloring and equitable choosability of planar graphs without 5- and 7-cycles
A graph G is equitably k-choosable if for any k-uniform list assignment L, G is L-colorable and each color appears on at most djV(G)j=ke vertices. A graph G is equitable kcolorable if G has a proper vertex coloring with k colors such that the size of the color classes differ by at most 1. In this pa...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Journal |
| Published: |
Bulletin of the Malaysian Mathematical Sciences Society , Malaysian Mathematical Sciences Society, Universiti Sains Malaysia, Springer
2012
|
| Subjects: | |
| Online Access: | http://www.myjurnal.my/public/article-view.php?id=65044 |