THE EQUITABLE COLORING OF THE BIPARTITE GRAPHS
碩士 === 東海大學 === 應用數學研究所 === 83 === If the vertices of a graph G can be partitioned into k indepen- dent set and the difference of the sizes of any two sets is less than 1, then G is said to be equitably k-colorable. The smallest integer n f...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1995
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/20881214436627862909 |