ABSTRACT
A frequent question in graph theory is whether a given graph is a tree, bipartite, connected, a product, a median graph, a hypercube, or member of some other class of graphs. Our aim in Part IV is to provide efficient algorithms that answer these questions for the graphs considered in this book. On the way to answering these questions, we have to solve a number of lesser problems: We must represent graphs by appropriate data structures and exhibit efficient algorithms for basic operations, such as vertex insertion or deletion.
