Every planar map is four colorable
Material type:
TextSeries: Contemporary Mathematics ; 98Publication details: Providence American Mathematical Society 1989Description: xv, 741pSubject(s): DDC classification: - 511.5 Ap646.EP
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Book
|
ISID | 511.5 Ap646.EP (Browse shelf(Opens below)) | Available | DP22345 |
Browsing ISID shelves Close shelf browser (Hides shelf browser)
| No cover image available |
|
|
No cover image available |
|
No cover image available |
|
||
| 511.5 An554.IG Introductory graph theory / | 511.5 An557.GC Graph classes: a survey / | 511.5 An628.DM Discrete mathematics of neural networks : selected topics / | 511.5 Ap646.EP Every planar map is four colorable | 511.5 Av958.GT Graph theory and combinatorial optimization / | 511.5 B171.ID Introductory discrete mathematics / | 511.5 B171.TG A textbook of graph theory / |
There are no comments on this title.
Log in to your account to post a comment.