Every planar map is four colorable / [electronic resource] Kenneth Appel, and Wolfgang Haken.
Material type: TextSeries: Contemporary mathematics (American Mathematical Society) ; v. 98.Publication details: Providence, R.I. : American Mathematical Society, c1989Description: 1 online resource (xv, 741 p. : ill.)ISBN: 9780821876862 (online)Subject(s): Four-color problemAdditional physical formats: Every planar map is four colorable /DDC classification: 511/.5 LOC classification: QA612.18 | .A67 1989Online resources: Contents | ContentsCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK11378 |
Includes bibliographical references.
Introduction Part I: Discharging Part II: Reducibility Appendix to Part II Supplement to Part I Supplement to Part II Corresponding Class Check Lists
Access is restricted to licensed institutions
Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012
Mode of access : World Wide Web
Description based on print version record.
There are no comments on this title.