Kód: 17063056
We present a new polynomial-time algorithm for finding proper m-colorings of the vertices of a graph. We prove that every graph with n vertices and maximum vertex degree Delta must have chromatic number Chi(G) less than or equal t ... celý popis
Angličtina
15.79 €
Bežne: 17 €
Ušetríte 1.22 €

Nákupom získate 38 bodov
Anotácia knihy
We present a new polynomial-time algorithm for finding proper m-colorings of the vertices of a graph. We prove that every graph with n vertices and maximum vertex degree Delta must have chromatic number Chi(G) less than or equal to Delta+1 and that the alg
Parametre knihy
15.79 €
Angličtina
Osobný odber Bratislava a 12593 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies
24 miliónov titulov
Vrátenie do mesiaca
02/210 210 99 (8-15.30h)Nákupný košík ( prázdny )
Nachádzate sa: