CRM Proceedings & Lecture Notes 1999; 149 pp; softcover Volume: 23 ISBN10: 0821819550 ISBN13: 9780821819555 List Price: US$49 Member Price: US$39.20 Order Code: CRMP/23
 This volume presents the proceedings of the CRM workshop on graph coloring and applications. The articles span a wide spectrum of topics related to graph coloring, including: listcolorings, total colorings, colorings and embeddings of graphs, chromatic polynomials, characteristic polynomials, chromatic scheduling, and graph coloring problems related to frequency assignment. Outstanding researchers in combinatorial optimization and graph theory contributed their work. A list of open problems is included. Titles in this series are copublished with the Centre de Recherches Mathématiques. Readership Graduate students and research mathematicians interested in combinatorics. Table of Contents  D. K. Arrowsmith and J. W. Essam  Chromatic polynomials and mod \(\lambda\) flows on directed graphs and their applications
 K. L. Collins and J. P. Hutchinson  Fourcoloring sixregular graphs on the torus
 M. Dror, G. Finke, S. Gravier, and W. Kubiak  On the complexity of a restricted listcoloring problem
 G. M. Hamilton, A. J. W. Hilton, and H. R. F. Hind  Totally critical graphs and the conformability conjecture
 F. Harary and M. Plantholt  Graphs whose radio coloring number equals the number of nodes
 O. Marcotte and P. Hansen  The height and length of colour switching
 H. Sachs  Characteristic polynomials in the theory of polyhedra
 T. R. Walsh  The number of edge 3colourings of the \(n\)prism
 T. R. Walsh  The cost of radiocolouring paths and cycles
 D. de Werra  Restricted graph coloring: Some mathematical programming models
 Open problems
