AMS Bookstore LOGO amslogo
Return to List  Item: 1 of 1   
Graph Colouring and Applications
Edited by: Pierre Hansen, École des Hautes Études Commerciales, Montréal, QC, Canada, and Odile Marcotte, Université du Québec à Montréal, PQ, Canada
A co-publication of the AMS and Centre de Recherches Mathématiques.

CRM Proceedings & Lecture Notes
1999; 149 pp; softcover
Volume: 23
ISBN-10: 0-8218-1955-0
ISBN-13: 978-0-8218-1955-5
List Price: US$49
Member Price: US$39.20
Order Code: CRMP/23
[Add Item]

Request Permissions

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: list-colorings, 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 co-published with the Centre de Recherches Mathématiques.


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 -- Four-coloring six-regular graphs on the torus
  • M. Dror, G. Finke, S. Gravier, and W. Kubiak -- On the complexity of a restricted list-coloring 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 3-colourings of the \(n\)-prism
  • T. R. Walsh -- The cost of radio-colouring paths and cycles
  • D. de Werra -- Restricted graph coloring: Some mathematical programming models
  • Open problems
Powered by MathJax
Return to List  Item: 1 of 1   

  AMS Home | Comments:
© Copyright 2014, American Mathematical Society
Privacy Statement

AMS Social

AMS and Social Media LinkedIn Facebook Podcasts Twitter YouTube RSS Feeds Blogs Wikipedia