Readings Newsletter
Become a Readings Member to make your shopping experience even easier.
Sign in or sign up for free!
You’re not far away from qualifying for FREE standard shipping within Australia
You’ve qualified for FREE standard shipping within Australia
The cart is loading…
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
This book studies algebraic representations of graphs in order to investigate combinatorial structures via local symmetries. Topological, combinatorial and algebraic classifications are distinguished by invariants of polynomial type and algorithms are designed to determine all such classifications with complexity analysis. Being a summary of the author’s original work on graph embeddings, this book is an essential reference for researchers in graph theory.
Contents Abstract Graphs Abstract Maps Duality Orientability Orientable Maps Nonorientable Maps Isomorphisms of Maps Asymmetrization Asymmetrized Petal Bundles Asymmetrized Maps Maps within Symmetry Genus Polynomials Census with Partitions Equations with Partitions Upper Maps of a Graph Genera of a Graph Isogemial Graphs Surface Embeddability
$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout
This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.
This book studies algebraic representations of graphs in order to investigate combinatorial structures via local symmetries. Topological, combinatorial and algebraic classifications are distinguished by invariants of polynomial type and algorithms are designed to determine all such classifications with complexity analysis. Being a summary of the author’s original work on graph embeddings, this book is an essential reference for researchers in graph theory.
Contents Abstract Graphs Abstract Maps Duality Orientability Orientable Maps Nonorientable Maps Isomorphisms of Maps Asymmetrization Asymmetrized Petal Bundles Asymmetrized Maps Maps within Symmetry Genus Polynomials Census with Partitions Equations with Partitions Upper Maps of a Graph Genera of a Graph Isogemial Graphs Surface Embeddability