Online Public Access Catalogue (OPAC)
Central Library - Vidyasagar University

“Education does not only mean learning, reading, writing, and arithmetic,

it should provide a comprehensive knowledge”

-Ishwarchandra Vidyasagar


Normal view MARC view ISBD view

Graphs and Homomorphisms [ electronic resource ] / by Pavol Hell and Jaroslav Nesetril.

By: Hell, Pavol.
Contributor(s): Nesetril, Jaroslav [joint author].
Material type: TextTextPublisher: Oxford Scholarship Online , 2007ISBN: 9780198528173 ( e-book ).Subject(s): MathematicsGenre/Form: Electronic booksOnline resources: https://doi.org/10.1093/acprof:oso/9780198528173.001.0001 View to click Summary: Graph 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode
E-Book E-Book WWW
Available EB625

Graph 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.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha