A lower bound on the chromatic number of Mycielski graphs

Discrete Mathematics

Volumn 235, Issue 1-3, 2001, Pages 79-86

  Caramia, Massimiliano ^a   Dell'Olmo, Paolo ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Benchmarks; Chromatic number; Lower bound; Multiprocessor task scheduling; Mycielski graphs

Indexed keywords

EID: 0035962735     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00261-2     Document Type: Article

References (14)

1. L. Bianco, P. Dell'Olmo, M.G. Speranza, Nonpreemptive scheduling of independent tasks with prespecified processors allocation, Naval Res. Logist. 41 (1994) 959-971.
2. M. Caramia, P. Dell'Olmo, Iterative coloring extension of a maximum clique, Technical Report Centro Vito Volterra, University of Rome Tor Vergata, 1998, Naval Res. Logist., to appear.
3. A. Condon, G. Lewandowski, Experiments with parallel graphs coloring heuristics and applications of graph coloring, in: D.S. Johnson, M.A. Trick (Eds.), Second DIMACS Challenge: Cliques, Coloring, and Satisfiability, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, AMS, Providence, RI, 1996.
4. M. Gardner, The Unexpected Hanging and Other Mathematical Diversions, Simon and Schuster, New York, 1969.
5. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, San Francisco, 1979.
6. F. Harary, Graph theory, Addison-Wesley, Reading, MA, 1969.
7. D.E. Knuth, The Standford GraphBase, ACM Press, Addison-Wesley, New York, 1993.
8. E. Marczewski, Sur deux propriétés des classes d'ensembles, Fund. Math. 33 (1945) 303-307.
9. A. Mehrotra, M.A. Trick, A column generation approach for graph coloring, INFORMS J. Comput. 8 (1996) 344-354.
10. J. Mycielski, Sur le Coloriage des Graphes, Colloq. Math. 3 (1955) 161-162.
11. M. Pinedo, Scheduling: Theory, Algorithms and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995.
12. F.S. Roberts, Applications of edge coverings by cliques, Discrete Appl. Math. 10 (1985) 93-109.
13. B.C. Sewell, An improved algorithm for exact graph goloring, in: D.S. Johnson, M.A. Trick (Eds.), Second DIMACS Challenge (COLORING Papers), DIMACS Series in Computer Mathematics and Theoretical Computer Science, AMS, Providence, RI, 1996.
14. D.B. West, Parameters of partial orders and graphs: packing, covering and representation, in: I. Rival (Ed.), Graph and Orders, Reidel, Dordrecht, 1985.