Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
The following link can be shared to navigate to this page. You can select the link to copy or click the 'Copy To Clipboard' button below.
Copy To Clipboard
Successfully Copied!
Graph Colouring and Applications
 
Edited by: Pierre Hansen École des Hautes Études Commerciales, Montréal, QC, Canada
Odile Marcotte Université du Québec à Montréal, Montréal, PQ, Canada
A co-publication of the AMS and Centre de Recherches Mathématiques
Front Cover for Graph Colouring and Applications
Available Formats:
Softcover ISBN: 978-0-8218-1955-5
Product Code: CRMP/23
List Price: $52.00
MAA Member Price: $46.80
AMS Member Price: $41.60
Electronic ISBN: 978-1-4704-3937-8
Product Code: CRMP/23.E
List Price: $49.00
MAA Member Price: $44.10
AMS Member Price: $39.20
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $78.00
MAA Member Price: $70.20
AMS Member Price: $62.40
Front Cover for Graph Colouring and Applications
Click above image for expanded view
  • Front Cover for Graph Colouring and Applications
  • Back Cover for Graph Colouring and Applications
Graph Colouring and Applications
Edited by: Pierre Hansen École des Hautes Études Commerciales, Montréal, QC, Canada
Odile Marcotte Université du Québec à Montréal, Montréal, PQ, Canada
A co-publication of the AMS and Centre de Recherches Mathématiques
Available Formats:
Softcover ISBN:  978-0-8218-1955-5
Product Code:  CRMP/23
List Price: $52.00
MAA Member Price: $46.80
AMS Member Price: $41.60
Electronic ISBN:  978-1-4704-3937-8
Product Code:  CRMP/23.E
List Price: $49.00
MAA Member Price: $44.10
AMS Member Price: $39.20
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $78.00
MAA Member Price: $70.20
AMS Member Price: $62.40
  • Book Details
     
     
    CRM Proceedings & Lecture Notes
    Volume: 231999; 149 pp
    MSC: Primary 05; Secondary 68;

    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.

    Readership

    Graduate students and research mathematicians interested in combinatorics.

  • Table of Contents
     
     
    • Chapters
    • Chromatic polynomials and mod $\lambda $ flows on directed graphs and their applications
    • Four-coloring six-regular graphs on the torus
    • On the complexity of a restricted list-coloring problem
    • Totally critical graphs and the conformability conjecture
    • Graphs whose radio coloring number equals the number of nodes
    • The height and length of colour switching
    • Characteristic polynomials in the theory of polyhedra
    • The number of edge 3-colourings of the $n$-prism
    • The cost of radio-colouring paths and cycles
    • Restricted graph coloring: Some mathematical programming models
  • Request Review Copy
Volume: 231999; 149 pp
MSC: Primary 05; Secondary 68;

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.

Readership

Graduate students and research mathematicians interested in combinatorics.

  • Chapters
  • Chromatic polynomials and mod $\lambda $ flows on directed graphs and their applications
  • Four-coloring six-regular graphs on the torus
  • On the complexity of a restricted list-coloring problem
  • Totally critical graphs and the conformability conjecture
  • Graphs whose radio coloring number equals the number of nodes
  • The height and length of colour switching
  • Characteristic polynomials in the theory of polyhedra
  • The number of edge 3-colourings of the $n$-prism
  • The cost of radio-colouring paths and cycles
  • Restricted graph coloring: Some mathematical programming models
Please select which format for which you are requesting permissions.