Periodic assignment and graph colouring

This publication has 22 references indexed in Scilit:

• A better performance guarantee for approximate graph coloring
  Algorithmica, 1990
• An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
  SIAM Journal on Computing, 1989
• The Complexity of Coloring Circular Arcs and Chords
  SIAM Journal on Algebraic Discrete Methods, 1980
• An Optimal Solution for the Channel-Assignment Problem
  IEEE Transactions on Computers, 1979
• On the complexity of computing the measure of ∪[a _i ,b _i ]
  Communications of the ACM, 1978
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
  Journal of Computer and System Sciences, 1976
• Algorithms on circular‐arc graphs
  Networks, 1974
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
  SIAM Journal on Computing, 1973
• Incidence matrices and interval graphs
  Pacific Journal of Mathematics, 1965
• A Characterization of Comparability Graphs and of Interval Graphs
  Canadian Journal of Mathematics, 1964