Decomposing G = ( V, E ) into Planar Graphs

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 is our attempt to answer the question, "Is it possible to decompose any graph G with n vertices, lacking any specific symmetry of the underlying structures?" This book presents a solution to this question by developing iterative techniques in an intuitive, simple, and visual way without losing the essence of the underlying mathematics. We trust that this method of decomposing any graph into known subgraphs will open new directions in graph decomposition. This book will be of interest to researchers in graph theory and discrete mathematics.