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...

Full description

Bibliographic Details

Published in:	Theory and Applications of Graphs
Main Authors:	Peter Johnson, Xiaoya Zha
Format:	Article
Language:	English
Published:	Georgia Southern University 2015-01-01
Subjects:	fractional chromatic number independent set vertex independence number
Online Access:	https://digitalcommons.georgiasouthern.edu/tag/vol2/iss2/3