Combinatorial Theory (Classics in Mathematics)
Our rough guess is there are 125,000 words in this book.
At a pace averaging 250 words per minute, this book will take 8 hours and 20 minutes to read. With a half hour per day, this will take 17 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.
Word Count
125,000 words, Guess
Page Count
500 pages
Physical Format
Paperback
Identifiers
- ISBN-103540617876
- ISBN-139783540617877
- LibraryThing198011
- Open LibraryOL9061993M
First Sentence
An undirected graph G(V,E) consists of a non-empty set V, called the vertex-set and a multiset E of unordered pairs {a, b} from V, called the edge-set.
Subjects
Similar Books
A Beginner's Guide to Graph Theory
W.D. Wallis
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)
Dieter Jungnickel
Physical combinatorics
Masaki Kashiwara, Tetsuji Miwa, editors
Combinatorics: topics, techniques, algorithms
Peter J. Cameron.
Across the Board: The Mathematics of Chessboard Problems
John J. Watkins, John J. Watkins
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!