Pearls in Graph Theory: A Comprehensive Introduction

Pearls in Graph Theory: A Comprehensive Introduction

by Nora Hartsfield, Gerhard Ringel
     
 

The Dover edition reprints the 1994 Academic Press edition, which itself was an augmented and revised version of a 1990 work. Harsfield (Western Washington U.) and Ringel (U. of California, Santa Cruz) cover basic graph theory, coloring of graphs, circuits and cycles, extremal problems, counting, labeling, applications and algorithms, drawings of graphs, measurements… See more details below

Overview

The Dover edition reprints the 1994 Academic Press edition, which itself was an augmented and revised version of a 1990 work. Harsfield (Western Washington U.) and Ringel (U. of California, Santa Cruz) cover basic graph theory, coloring of graphs, circuits and cycles, extremal problems, counting, labeling, applications and algorithms, drawings of graphs, measurements of closeness to planarity, and graphs on surfaces. Annotation © 2004 Book News, Inc., Portland, OR

Product Details

ISBN-13:
9780123285522
Publisher:
Elsevier Science & Technology Books
Publication date:
07/01/1990
Pages:
246
Product dimensions:
6.30(w) x 9.45(h) x (d)

Table of Contents

Foreword to the Revised Editionvii
Forewordix
Chapter 1.Basic Graph Theory
1.1Graphs and Degrees of Vertices1
1.2Subgraphs, Isomorphic Graphs13
1.3Trees17
Chapter 2.Colorings of Graphs
2.1Vertex Colorings23
2.2Edge Colorings31
2.3Decompositions and Hamilton Cycles35
2.4More Decomposition43
Chapter 3.Circuits and Cycles
3.1Eulerian Circuits49
3.2The Oberwolfach Problem58
3.3Infinite Lattice Graphs65
Chapter 4.Extremal Problems
4.1A Theorem of Turan70
4.2Cages77
4.3Ramsey Theory81
Chapter 5.Counting
5.1Counting 1-Factors87
5.2Cayley's Spanning Tree Formula94
5.3More Spanning Trees100
Chapter 6.Labeling Graphs
6.1Magic Graphs and Graceful Trees104
6.2Conservative Graphs114
Chapter 7.Applications and Algorithms
7.1Spanning Tree Algorithms125
7.2Matchings in Graphs, Scheduling Problems133
7.3Binary Trees and Prefix Codes140
Chapter 8.Drawings of Graphs
8.1Planar Graphs149
8.2The Four Color Theorem156
8.3The Five Color Theorem164
8.4Graphs and Geometry168
Chapter 9.Measurements of Closeness to Planarity
9.1Crossing Number179
9.2Thickness and Splitting Number190
9.3Heawood's Empire Problem197
Chapter 10.Graphs on Surfaces
10.1Rotations of Graphs208
10.2Planar Graphs Revisited217
10.3The Genus of a Graph225
References241
Index245

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >