| 000 | 01604nam a22002417a 4500 | ||
|---|---|---|---|
| 999 |
_c57730 _d57730 |
||
| 003 | IN-MiVU | ||
| 005 | 20191216133818.0 | ||
| 006 | m|||||o||d| 00| 0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 180601s2007 xxu||||go|||| 00| 0 eng d | ||
| 020 | _a9780198528173 ( e-book ) | ||
| 040 |
_aMAIN _beng _cIN-MiVU |
||
| 041 | 0 | _aeng | |
| 100 | 1 | _aHell, Pavol | |
| 245 | 0 | 0 |
_aGraphs and Homomorphisms [ electronic resource ] / _cby Pavol Hell and Jaroslav Nesetril. |
| 260 |
_bOxford Scholarship Online , _c2007 |
||
| 520 | _aGraph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. This text is devoted entirely to the subject, bringing together the highlights of the theory and its many applications. It looks at areas such as graph reconstruction, products, fractional and circular colourings, and constraint satisfaction problems, and has applications in complexity theory, artificial intelligence, telecommunications, and statistical physics. It has a wide focus on algebraic, combinatorial, and algorithmic aspects of graph homomorphisms. A reference list and historical summaries extend the material explicitly discussed. The book contains exercises of varying difficulty. Hints or references are provided for the more difficult exercises. | ||
| 650 | 1 | 0 | _aMathematics |
| 655 | 4 | _aElectronic books | |
| 700 | 1 |
_a Nesetril, Jaroslav _ejoint author |
|
| 856 | 4 | 0 |
_uhttps://doi.org/10.1093/acprof:oso/9780198528173.001.0001 _yhttps://doi.org/10.1093/acprof:oso/9780198528173.001.0001 _zView to click |
| 942 |
_2ddc _cEB |
||