A generalized implicit enumeration algorithm for graph coloring
Communications of the ACM - Lecture notes in computer science Vol. 174
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
IEEE Transactions on Computers
The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem
SIAM Journal on Computing
The chromatic index of nearly bipartite multigraphs
Journal of Combinatorial Theory Series B
Efficient vertex- and edge-coloring of outerplanar graphs
SIAM Journal on Algebraic and Discrete Methods
A correction to Brelaz's modification of Brown's coloring algorithm
Communications of the ACM
New methods to color the vertices of a graph
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
| Hi-index | 14.98 |
The author addresses the problem, arising in the topology design of packet radio networks (PRNs) which use time-division multiplexing and have a diameter constraint, of what is the maximum number n/sub c/(f,k) of users which can be contained in a diameter-k PRN with f time slots per frame. The author assumed that users cannot transmit and receive simultaneously and cannot transmit/receive more than one packet at a time. This assumption implies that no two channels accessed by the same user may be assigned the same time slot. It is shown that the problem of determining n/sub c/(f,k) is identical to the problem of determining the largest number of vertices which can be contained in an f-edge colorable directed graph with diameter k. Lower bounds on n/sub c/(f,k) for f/2, k=3, 4, 5, . . . are obtained by generating large graphs of this type. The graphs are constructed and colored by simple and fast procedures which are similar for different values of f and k. An extensive bibliography on the edge-coloring problem is included.