AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution

Graph Colouring and Applications

About this Title

Pierre Hansen, École des Hautes Études Commerciales, Montréal, QC, Canada and Odile Marcotte, Université du Québec à Montréal, Montréal, PQ, Canada, Editors

Publication: CRM Proceedings and Lecture Notes
Publication Year: 1999; Volume 23
ISBNs: 978-0-8218-1955-5 (print); 978-1-4704-3937-8 (online)
DOI: https://doi.org/10.1090/crmp/023
MathSciNet review: MR1723632
MSC: Primary 05-06

Read more about this volume

Table of Contents

Front/Back Matter

• View this volume's front and back matter

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

View full volume PDF