Buch, Englisch, Band 352, Gewicht: 407 g
Reihe: Contemporary Mathematics S.
Buch, Englisch, Band 352, Gewicht: 407 g
Reihe: Contemporary Mathematics S.
ISBN: 978-0-8218-3458-9
Verlag: American Mathematical Society
Originally appearing in Polish as Optymalizacja dyskretna; Modele i metody kolorowania graf, this monograph considers problems in graph coloring, viewing them as an aspect of discrete optimization. Chapters are dedicated to the various models, and highlight algorithmic aspects of each. Individual chapters are largely independent of one another. Th
Graph coloring is one of the oldest and best-known problems of graph theory. As people grew accustomed to applying the tools of graph theory to the solutions of real-world technological and organizational problems, new chromatic models emerged as a natura
Classical coloring of graphs; On-line coloring of graphs; Equitable coloring of graphs; Sum coloring of graphs; $T$-coloring of graphs; Rank coloring of graphs; Harmonious coloring of graphs; Interval edge-coloring of graphs; Circular coloring of graphs; Path coloring and routing in graphs; List colorings of graphs; Ramsey colorings of complete graphs; Placing guards in art galleries by graph coloring; Bibliography; Index; Authors' addresses
