The Oriented Colourings of Bipartite Graphs
碩士 === 國立中山大學 === 應用數學系研究所 === 94 === Let S be a set of k distinct elements. An oriented k coloring of an oriented graph D is a mapping f:V(D)→S such that (i) if xy is conatined in A(D), then f(x)≠f(y) and (ii) if xy,zt are conatined in A(D) and f(x)=f(t), then f(y)≠f(z). The oriented chromatic numb...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/19556276578747163560 |