| 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 |
-
Book DetailsCRM Proceedings & Lecture NotesVolume: 23; 1999; 149 ppMSC: 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.
ReadershipGraduate 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
-
-
RequestsReview Copy – for reviewers who would like to review an AMS bookAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Requests
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.
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
