opac header image
Image from Google Jackets
Image from Coce

Graphs, groups, and surfaces [electronic resource] / Arthur T. White.

By: White, Arthur TMaterial type: TextTextSeries: North-Holland mathematics studies ; 8.Publication details: Amsterdam ; New York : New York, N.Y., U.S.A. : North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1984. Edition: Completely rev. and enl. edDescription: 1 online resource (xiii, 314 p.) : illISBN: 9780444876430; 044487643XSubject(s): Graph theory | Group theory | Combinatorial topology | Combinatorial topology | Graph theory | Group theoryGenre/Form: Electronic books.Additional physical formats: Print version:: Graphs, groups, and surfaces.DDC classification: 511/.5 LOC classification: QA166 | .W45 1984ebOnline resources: ScienceDirect | Volltext Summary: The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing. Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'' and 9 as ``unsolved''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing. Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'' and 9 as ``unsolved''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''.

Includes bibliographical references (p. 303-304).

Includes indexes.

Description based on print version record.

There are no comments on this title.

to post a comment.
© 2024 Copyright: Customised and Maintained by Central Library NISER

Central Library, NISER Library Building, PO-Jatni, Khurda, Odisha - 752050, India | Email: libniser@niser.ac.in Phone: +91-674-2494171

Powered by Koha