Hostname: page-component-cb9f654ff-5jtmz Total loading time: 0 Render date: 2025-08-24T19:00:27.896Z Has data issue: false hasContentIssue false
  • English
  • Français

Note on the Structure of Graphs

Published online by Cambridge University Press:  20 November 2018

G.A. Dirac
G.A. Dirac*
Affiliation:
Hamilton College, McMaster University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

This paper is concerned with undirected graphs which may be infinite and may contain multiple edges. The Axiom of Choice is assumed. The terms path, infinite path and circuit are used in the same sense as Weg, unendlicher Weg and Kreis, respectively, are used in D. Konig's book [1]. The valency of a vertex is the number of edges incident with it.The length of a path is the number of edges in it. The following theorem is a generalization of the well known fact that if a vertex of a graph is not a cut-vertex (Artikulation [2]) and has valency ≧2, then the graph contains at least one circuit to which the vertex belongs.

Information

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 5 , Issue 3 , September 1962 , pp. 221 - 227
Copyright
Copyright © Canadian Mathematical Society 1962

References

1. König, D., Th?orie der endlichen und unendlichen Graphen, Leipzig, 1936.Google Scholar
König, D. p. 224.Google Scholar
König, D. p. 80, Satz 3.Google Scholar