Sold Out
Book Categories |
Preface | ||
Introduction | 1 | |
Ch. 1 | The Lower Chromatic Number of a Hypergraph | 11 |
Ch. 2 | Mixed Hypergraphs and the Upper Chromatic Number | 27 |
Ch. 3 | Uncolorable Mixed Hypergraphs | 45 |
Ch. 4 | Uniquely Colorable Mixed Hypergraphs | 59 |
Ch. 5 | C-perfect Mixed Hypergraphs | 79 |
Ch. 6 | Gaps in the Chromatic Spectrum | 89 |
Ch. 7 | Interval Mixed Hypergraphs | 101 |
Ch. 8 | Pseudo-chordal Mixed Hypergraphs | 107 |
Ch. 9 | Circular Mixed Hypergraphs | 119 |
Ch. 10 | Planar Mixed Hypergraphs | 129 |
Ch. 11 | Coloring Block Designs as Mixed Hypergraphs | 141 |
Ch. 12 | Modelling with Mixed Hypergraphs | 155 |
Bibliography | 171 | |
List of Figures | 179 | |
Index | 181 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionColoring Mixed Hypergraphs: Theory, Algorithms, and Applications
X
This Item is in Your InventoryColoring Mixed Hypergraphs: Theory, Algorithms, and Applications
X
You must be logged in to review the productsX
X
X
Add Coloring Mixed Hypergraphs: Theory, Algorithms, and Applications, 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, , Coloring Mixed Hypergraphs: Theory, Algorithms, and Applications to the inventory that you are selling on WonderClubX
X
Add Coloring Mixed Hypergraphs: Theory, Algorithms, and Applications, 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, , Coloring Mixed Hypergraphs: Theory, Algorithms, and Applications to your collection on WonderClub |