Summary
International Technical Conference on Circuits/Systems, Computers and Communications
2016
Session Number:T2-3
Session:
Number:4811
Study on Several Graph Coloring Problems related with Wireless Networks
Shun Matsumoto, Hiroshi Tamura ,
pp.515-518
Publication Date:2016/7/10
Online ISSN:2188-5079
Summary:
In wireless network, each channel assigns to each communication. Then, if the same channel uses at close range, comfortable communication can not be performed by interference. To consider this problem, it is known widely how to replace the channel assignment problem to the coloring problem of the graph. In this paper, we pick up some colorings and a extension of them, examined the minimum number of colors on the graph of tree that the degree is constant.