Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions

The chromatic number has a well-known interpretation in the area of scheduling. If the vertices of a finite, simple graph are committees, and adjacency of two committees indicates that they must never be in session simultaneously, then the chromatic number of the graph is the smallest number of hour...

詳細記述

書誌詳細
出版年:Theory and Applications of Graphs
主要な著者: Peter Johnson, Xiaoya Zha
フォーマット: 論文
言語:英語
出版事項: Georgia Southern University 2015-01-01
主題:
オンライン・アクセス:https://digitalcommons.georgiasouthern.edu/tag/vol2/iss2/3

類似資料