Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Coloring Mixed Hypergraphs: Theory, Algorithms and Applications
 
Vitaly I. Voloshin Moldovan Academy of Sciences, Kishinev, Republic of Moldova
A co-publication of the AMS and Fields Institute
Front Cover for Coloring Mixed Hypergraphs: Theory, Algorithms and Applications
HardcoverISBN:  978-0-8218-2812-0
Product Code:  FIM/17
List Price: $64.00
MAA Member Price: $57.60
AMS Member Price: $51.20
eBookISBN:  978-1-4704-3144-0
Product Code:  FIM/17.E
List Price: $60.00
MAA Member Price: $54.00
AMS Member Price: $48.00
HardcoverISBN:  978-0-8218-2812-0
eBookISBN:  978-1-4704-3144-0
Product Code:  FIM/17.B
List Price: $124.00$94.00
MAA Member Price: $111.60$84.60
AMS Member Price: $99.20$75.20
Front Cover for Coloring Mixed Hypergraphs: Theory, Algorithms and Applications
Click above image for expanded view
  • Front Cover for Coloring Mixed Hypergraphs: Theory, Algorithms and Applications
  • Back Cover for Coloring Mixed Hypergraphs: Theory, Algorithms and Applications
Coloring Mixed Hypergraphs: Theory, Algorithms and Applications
Vitaly I. Voloshin Moldovan Academy of Sciences, Kishinev, Republic of Moldova
A co-publication of the AMS and Fields Institute
Hardcover ISBN:  978-0-8218-2812-0
Product Code:  FIM/17
List Price: $64.00
MAA Member Price: $57.60
AMS Member Price: $51.20
eBook ISBN:  978-1-4704-3144-0
Product Code:  FIM/17.E
List Price: $60.00
MAA Member Price: $54.00
AMS Member Price: $48.00
Hardcover ISBN:  978-0-8218-2812-0
eBookISBN:  978-1-4704-3144-0
Product Code:  FIM/17.B
List Price: $124.00$94.00
MAA Member Price: $111.60$84.60
AMS Member Price: $99.20$75.20
  • Book Details
     
     
    Fields Institute Monographs
    Volume: 172002; 181 pp
    MSC: Primary 05; Secondary 68;

    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.

    Readership

    Graduate students and pure and applied mathematicians interested in discrete mathematics, combinatorial optimization, operations research, computer science, software engineering, molecular biology, and related businesses and industry.

  • Table of Contents
     
     
    • Chapters
    • Chapter 1. Introduction
    • Chapter 2. The lower chromatic number of a hypergraph
    • Chapter 3. Mixed hypergraphs and the upper chromatic number
    • Chapter 4. Uncolorable mixed hypergraphs
    • Chapter 5. Uniquely colorable mixed hypergraphs
    • Chapter 6. $\mathcal {C}$-perfect mixed hypergraphs
    • Chapter 7. Gaps in the chromatic spectrum
    • Chapter 8. Interval mixed hypergraphs
    • Chapter 9. Pseudo-chordal mixed hypergraphs
    • Chapter 10. Circular mixed hypergraphs
    • Chapter 11. Planar mixed hypergraphs
    • Chapter 12. Coloring block designs as mixed hypergraphs
    • Chapter 13. Modelling with mixed hypergraphs
  • Additional Material
     
     
  • Requests
     
     
    Review Copy – for reviewers who would like to review an AMS book
    Accessibility – to request an alternate format of an AMS title
Volume: 172002; 181 pp
MSC: Primary 05; Secondary 68;

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.

Readership

Graduate students and pure and applied mathematicians interested in discrete mathematics, combinatorial optimization, operations research, computer science, software engineering, molecular biology, and related businesses and industry.

  • Chapters
  • Chapter 1. Introduction
  • Chapter 2. The lower chromatic number of a hypergraph
  • Chapter 3. Mixed hypergraphs and the upper chromatic number
  • Chapter 4. Uncolorable mixed hypergraphs
  • Chapter 5. Uniquely colorable mixed hypergraphs
  • Chapter 6. $\mathcal {C}$-perfect mixed hypergraphs
  • Chapter 7. Gaps in the chromatic spectrum
  • Chapter 8. Interval mixed hypergraphs
  • Chapter 9. Pseudo-chordal mixed hypergraphs
  • Chapter 10. Circular mixed hypergraphs
  • Chapter 11. Planar mixed hypergraphs
  • Chapter 12. Coloring block designs as mixed hypergraphs
  • Chapter 13. Modelling with mixed hypergraphs
Review Copy – for reviewers who would like to review an AMS book
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.