Graph Colouring and Applications
American Mathematical Society (Verlag)
978-0-8218-1955-5 (ISBN)
- Titel z.Zt. nicht lieferbar
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
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.
Chromatic polynomials and mod $/lambda$ flows on directed graphs and their applications by D. K. Arrowsmith and J. W. Essam Four-coloring six-regular graphs on the torus by K. L. Collins and J. P. Hutchinson On the complexity of a restricted list-coloring problem by M. Dror, G. Finke, S. Gravier, and W. Kubiak Totally critical graphs and the conformability conjecture by G. M. Hamilton, A. J. W. Hilton, and H. R. F. Hind Graphs whose radio coloring number equals the number of nodes by F. Harary and M. Plantholt The height and length of colour switching by O. Marcotte and P. Hansen Characteristic polynomials in the theory of polyhedra by H. Sachs The number of edge 3-colourings of the $n$-prism by T. R. Walsh The cost of radio-colouring paths and cycles by T. R. Walsh Restricted graph coloring: Some mathematical programming models by D. de Werra Open problems.
| Erscheint lt. Verlag | 1.1.2000 |
|---|---|
| Reihe/Serie | CRM Proceedings & Lecture Notes |
| Zusatzinfo | Illustrations |
| Verlagsort | Providence |
| Sprache | englisch |
| Gewicht | 312 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
| ISBN-10 | 0-8218-1955-0 / 0821819550 |
| ISBN-13 | 978-0-8218-1955-5 / 9780821819555 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
