Graph colouring and the probabilistic method Molloy, Michael S.
Material type:
TextPublication details: Berlin ; | New York : Springer, 2002Description: xiv, 326 p. : ill. ; 25 cmISBN: - 3540421394 (alk. paper) | 978-35404213949
| Item type | Current library | Home library | Collection | Call number | Status | Barcode | |
|---|---|---|---|---|---|---|---|
Book
|
MATH-LiB General Stack | MATH-LiB | NFIC | 511.501519 P02;1 (Browse shelf(Opens below)) | Available | 194232 |
Total holds: 0
Browsing MATH-LiB shelves, Shelving location: General Stack Close shelf browser (Hides shelf browser)
|
|
|
No cover image available | No cover image available | No cover image available |
|
||
| 511.5 P124 Large networks and graph limits / | 511.5 P13 Hypergraph Theory : | 511.501154 P08 Graphs, networks, and algorithms | 511.501519 P02;1 Graph colouring and the probabilistic method | 511.5028551 P07 Laplacian eigenvectors of graphs : | 511.6 N71 Principles of combinatorics | 511.6 N792 Combinatorial theory |
There are no comments on this title.
Log in to your account to post a comment.