We commment on the problem of assigning papers to time-slots to minimize the time needed for a technical meeting. We claim that this problem is, in abstract, the problem of discovering a minimal coloring of a conflict graph. This approach contrasts with that of Joseph E. Grimes in [1]. Key words and phrases: allocation, conflict matrix, connected component, scheduling, spanning tree, undirected linear graph, graph node coloring, graph vertex coloring.