The purpose of this book is to present selected results on perfect graphs in a single volume. These take the form of reprinted classical papers, survey papers or new results.
--This text refers to an alternate
Paperback
edition.
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
decomposition algorithm, critical perfect graphs, strongly stable graph, perfect graph conjecture, minimal imperfection properties, imperfect graph, three stable sets, weight clique cover, clique cutset tree, partitionable graphs, concerning perfect graphs, weighted clique cover, weighted stable set problem, clique separable, maximum weighted stable set, strongly perfect graph, stable set cover, spanning subgraph isomorphic, arborescence forest, odd elementary cycle, perfect graph theorem, parity graph, primitive subgraphs, polynomial recognition algorithm, clique cover problem Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Math, New York, Elsevier Science Publishers, Las Vergnas, Academic Press, Färbung von Graphen, Cornell University, Proof of Theorem, School of Computer Science, Graph Theory, Magyar Tud, Claude Berge, Auflösung von Graphen, Studia Sci, Utilitas Math, Grenoble Cedex, Composition Theorem, Kutato Int, Linear Algebra, Halle-Wittenberg Math, Mathematical Programming, Marie Curie, Northwestern University, Soviet Math, Rédei's Theorem Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Surprise Me!
decomposition algorithm, critical perfect graphs, strongly stable graph, perfect graph conjecture, minimal imperfection properties, imperfect graph, three stable sets, weight clique cover, clique cutset tree, partitionable graphs, concerning perfect graphs, weighted clique cover, weighted stable set problem, clique separable, maximum weighted stable set, strongly perfect graph, stable set cover, spanning subgraph isomorphic, arborescence forest, odd elementary cycle, perfect graph theorem, parity graph, primitive subgraphs, polynomial recognition algorithm, clique cover problem Key Phrases - Capitalized Phrases (CAPs): (learn more)
Discrete Math, New York, Elsevier Science Publishers, Las Vergnas, Academic Press, Färbung von Graphen, Cornell University, Proof of Theorem, School of Computer Science, Graph Theory, Magyar Tud, Claude Berge, Auflösung von Graphen, Studia Sci, Utilitas Math, Grenoble Cedex, Composition Theorem, Kutato Int, Linear Algebra, Halle-Wittenberg Math, Mathematical Programming, Marie Curie, Northwestern University, Soviet Math, Rédei's Theorem Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Surprise Me!
Citations (learn more)
19
books
cite this book:
See all 19 books citing this book
- Graph Coloring Problems (Wiley Series in Discrete Mathematics and Optimization) by Tommy R. Jensen on 4 pages
- Recent Advances in Algorithms and Combinatorics by Bruce A. Reed on 4 pages
- Introduction to Parallel Algorithms (Wiley Series on Parallel and Distributed Computing) by C. Xavier on page 106, page 181, and page 209
- Tolerance Graphs (Cambridge Studies in Advanced Mathematics) by Martin Charles Golumbic on page 252, Back Matter (1), and Back Matter (2)
- Recursive Algebra, Analysis and Combinatorics, Volume Volume 2 (Studies in Logic and the Foundations of Mathematics) by Author Unknown on page 542, and page 643
See all 19 books citing this book
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
