Graphs and homomorphisms
Our rough guess is there are 61,000 words in this book.
At a pace averaging 250 words per minute, this book will take 4 hours and 4 minutes to read. With a half hour per day, this will take 8 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Author
Contributions
- Nešetřil, Jaroslav. - Contributor
Publication
2004 - Oxford University Press, Oxford, England
Language
English
Word Count
61,000 words, Guess
Page Count
244 pages
Identifiers
- Open LibraryOL3379184M
- ISBN-100198528175
- OCLC Control Number56375362
- OCLC Control Numbergraphshomomorphi00hell_131
- Library of Congress Control Number2004533593
and 2 more
- Goodreads1186686
- LibraryThing3692671
Classifications
- DDC511/.5
- LCCQA166 .H455 2004
Description
Based on the authors' lecture notes, this book is concerned with an aspect of graph theory that has broad applications to complexity theory, graph colourings, channel assignment and statistical physics. It contains exercises, hints and references.
Series Statement
- Oxford lecture series in mathematics and its applications ;
Other Editions
- Graphs and homomorphisms
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!