Non-Separable and Planar Graphs*

  • Hassler Whitney
Part of the Modern Birkhäuser Classics book series (MBC)


Introduction. In this paper the structure of graphs is studied by purely combinatorial methods. The concepts of rank and nullity are fundamental. The first part is devoted to a general study of non-separable graphs. Conditions that a graph be non-separable are given; the decomposition of a separable graph into its non-separable parts is studied; by means of theorems on circuits of graphs, a method for the construction of non-separable graphs is found, which is useful in proving theorems on such graphs by mathematical induction.


Planar Graph Abstract Graph Common Vertex Topological Graph Dual Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston, a part of Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Hassler Whitney
    • 1
  1. 1.Harvard UniversityCambridgeUSA

Personalised recommendations