On the r-Equitable Coloring of Complete Bipartite Graphs
碩士 === 國立嘉義大學 === 應用數學系研究所 === 100 === A graph G consists of a nonempty vertex set V(G) and an edge set E(G). All graphs considered in this thesis are finite, loopless, and without multiple edges. Let k be an integer. A (proper) k-coloring of a graph G is a mapping f : V(G) -> {1,2,...,k} su...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Online Access: | http://ndltd.ncl.edu.tw/handle/91730984459556075514 |