ISBN: 9780821828120 - fields institute monographs, vol.17. color mixed hypergraphs: theory, algorithms and applications (12 Ergebnisse)

Zustand: New. First edition, first printing, 181 pp., Hardcover, new. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Hardback. Zustand: New. The theory of graph coloring has existed for more than 150 years. Historically, graph coloring involved finding the minimum number of colors to be assigned to the vertices so that adjacent vertices would have different colors. From this modest beginning, the theory has become central in discrete mathematics with many contemporary generalizations and applications. Generalization of graph coloring-type problems to mixed hypergraphs brings many new dimensions to the theory of colorings. A main feature of this book is that in the case of hypergraphs, there exist problems on both the minimum and the maximum number of colors. This feature pervades the theory, methods, algorithms, and applications of mixed hypergraph coloring.The book has broad appeal. It will be of interest to both pure and applied mathematicians, particularly those in the areas of discrete mathematics, combinatorial optimization, operations research, computer science, software engineering, molecular biology, and related businesses and industries. It also makes a nice supplementary text for courses in graph theory and discrete mathematics. This is especially useful for students in combinatorics and optimization. Since the area is new, students will have the chance at this stage to obtain results that may become classic in the future.…

Zustand: New.

Hardcover. Zustand: Brand New. illustrated edition. 181 pages. 10.00x7.00x0.75 inches. In Stock.

Zustand: New. The theory of graph coloring has existed for more than 150 years. This book states that in the case of hypergraphs, there exist problems on both the minimum and the maximum number of colors. This feature pervades the theory, methods, algorithms, and applications of mixed hypergraph coloring. Series: Fields Institute Monographs. Num Pages: 181 pages, figures, bibliography, index. BIC Classification: PBV; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 190 x 261 x 15. Weight in Grams: 564. . 2002. Hardcover. . . . .…

Zustand: New. The theory of graph coloring has existed for more than 150 years. This book states that in the case of hypergraphs, there exist problems on both the minimum and the maximum number of colors. This feature pervades the theory, methods, algorithms, and applications of mixed hypergraph coloring. Series: Fields Institute Monographs. Num Pages: 181 pages, figures, bibliography, index. BIC Classification: PBV; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 190 x 261 x 15. Weight in Grams: 564. . 2002. Hardcover. . . . . Books ship from the US and Ireland.…

Zustand: As New. Unread book in perfect condition.

Zustand: New. In English.

Gebunden. Zustand: New. The theory of graph coloring has existed for more than 150 years. This book states that in the case of hypergraphs, there exist problems on both the minimum and the maximum number of colors. This feature pervades the theory, methods, algorithms, and applica.

Buch. Zustand: Neu. Neuware - The theory of graph coloring has existed for more than 150 years. This book states that in the case of hypergraphs, there exist problems on both the minimum and the maximum number of colors. This feature pervades the theory, methods, algorithms, and applications of mixed hypergraph coloring.…

Hardback. Zustand: New. The theory of graph coloring has existed for more than 150 years. Historically, graph coloring involved finding the minimum number of colors to be assigned to the vertices so that adjacent vertices would have different colors. From this modest beginning, the theory has become central in discrete mathematics with many contemporary generalizations and applications. Generalization of graph coloring-type problems to mixed hypergraphs brings many new dimensions to the theory of colorings. A main feature of this book is that in the case of hypergraphs, there exist problems on both the minimum and the maximum number of colors. This feature pervades the theory, methods, algorithms, and applications of mixed hypergraph coloring.The book has broad appeal. It will be of interest to both pure and applied mathematicians, particularly those in the areas of discrete mathematics, combinatorial optimization, operations research, computer science, software engineering, molecular biology, and related businesses and industries. It also makes a nice supplementary text for courses in graph theory and discrete mathematics. This is especially useful for students in combinatorics and optimization. Since the area is new, students will have the chance at this stage to obtain results that may become classic in the future.…