{"product_id":"chromaticity-of-hypergraphs-von-syed-ahtsham-ul-haq-bokhary","title":"Chromaticity of Hypergraphs","description":"\u003cp\u003eThe coloring the vertices of a graph is one of the fundamental concepts of graph  theory. It is widely believed that coloring was first mentioned in 1852 when Francis  Guthrie asked if four colors are enough to color any geographic map in such a way  that no two countries sharing a common border would have the same color. If we  denote the countries by points in the plane and connect each pair of points that  correspond to two countries with a common border by a curve, we obtain a planar  graph. The celebrated four color problem asks if every planer graph can be colored  with 4 colors. The four color problem became one of the most  famous problem in discrete mathematics of the 20th century. This has spawned the  development of many useful tools for solving graph coloring problems. The coloring of hypergraphs started in 1966 when P. Erdos and A. Hajnal introduced the notion of coloring of a hypergraph and obtained the first important  results. Since then many results in graph colorings have been extended to hyper-  graphs. This work focuses on the chromatic polynomial and chromatic uniqueness of  hypergraphs.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783846533888\"\u003e\u003ch3\u003eChromatic Polynomials and Chromatic  Uniqueness of Spernerian Hypergraphs\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783846533888","offer_id":40230092079197,"sku":"9783846533888","price":49.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/21fa7e78-7d0f-4786-8604-0f304a5508bd.jpg?v=1774936924","url":"https:\/\/shop.autorenwelt.de\/products\/chromaticity-of-hypergraphs-von-syed-ahtsham-ul-haq-bokhary","provider":"Autorenwelt Shop","version":"1.0","type":"link"}