Mohar / Thomassen | Graphs on Surfaces | Buch | 978-0-8018-6689-0 | sack.de

Buch, Englisch, Band 10, 304 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 647 g

Reihe: Johns Hopkins Studies in the Mathematical Sciences

Mohar / Thomassen

Graphs on Surfaces


Erscheinungsjahr 2001
ISBN: 978-0-8018-6689-0
Verlag: Johns Hopkins University Press

Buch, Englisch, Band 10, 304 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 647 g

Reihe: Johns Hopkins Studies in the Mathematical Sciences

ISBN: 978-0-8018-6689-0
Verlag: Johns Hopkins University Press


Graph theory is one of the fastest growing branches of mathematics. Until recently, it was regarded as a branch of combinatorics and was best known by the famous four-color theorem stating that any map can be colored using only four colors such that no two bordering countries have the same color. Now graph theory is an area of its own with many deep results and beautiful open problems. Graph theory has numerous applications in almost every field of science and has attracted new interest because of its relevance to such technological problems as computer and telephone networking and, of course, the internet. In this new book in the Johns Hopkins Studies in the Mathematical Science series, Bojan Mohar and Carsten Thomassen look at a relatively new area of graph theory: that associated with curved surfaces.

Graphs on surfaces form a natural link between discrete and continuous mathematics. The book provides a rigorous and concise introduction to graphs on surfaces and surveys some of the recent developments in this area. Among the basic results discussed are Kuratowski's theorem and other planarity criteria, the Jordan Curve Theorem and some of its extensions, the classification of surfaces, and the Heffter-Edmonds-Ringel rotation principle, which makes it possible to treat graphs on surfaces in a purely combinatorial way. The genus of a graph, contractability of cycles, edge-width, and face-width are treated purely combinatorially, and several results related to these concepts are included. The extension by Robertson and Seymour of Kuratowski's theorem to higher surfaces is discussed in detail, and a shorter proof is presented. The book concludes with a survey of recent developments on coloring graphs on surfaces.

Mohar / Thomassen Graphs on Surfaces jetzt bestellen!

Weitere Infos & Material


Chapter 1. Introduction
Chapter 2. Planar Graphs
Chapter 3. Surfaces
Chapter 4. Embeddings Combinatorially, Contractibility, of Cycles, and the Genus Problem
Chapter 5. The Width of Embeddings
Chapter 6. Embedding Extensions and Obstructions
Chapter 7. Tree-Width and the Excluded Minor Theorem
Chapter 8. Colorings of Graphs on Surfaces
Appendix A. The minmal forbidden subgraphs for the projective plane
Appendix B. The unavoidable configurations in planar triangulations
Bibliography
Index


Thomassen, Carsten
Carsten Thomassen is a professor at the Mathematical Institute of the Technical University of Denmark, the editor-in-chief of the Journal of Graph Theory, and a member of the Royal Danish Academy of Sciences and Letters.

Mohar, Bojan
Bojan Mohar is a professor in the Department of Mathematics at the University of Ljubljana in Slovenia and a member of the Engineering Academy of Slovenia.

Bojan Mohar is a professor in the Department of Mathematics at the University of Ljubljana in Slovenia and a member of the Engineering Academy of Slovenia. Carsten Thomassen is a professor at the Mathematical Institute of the Technical University of Denmark, the editor-in-chief of the Journal of Graph Theory, and a member of the Royal Danish Academy of Sciences and Letters.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.