Pacific Journal of Mathematics

Simple separable graphs.

R. H. Johnson

Article information

Source
Pacific J. Math., Volume 56, Number 1 (1975), 143-158.

Dates
First available in Project Euclid: 8 December 2004

Permanent link to this document
https://projecteuclid.org/euclid.pjm/1102906588

Mathematical Reviews number (MathSciNet)
MR0373963

Zentralblatt MATH identifier
0304.05105

Subjects
Primary: 05C99: None of the above, but in this section

Citation

Johnson, R. H. Simple separable graphs. Pacific J. Math. 56 (1975), no. 1, 143--158. https://projecteuclid.org/euclid.pjm/1102906588


Export citation

References

  • [1] Gary Chartrand and Mehdi Behzad, Introduction to the Theory of Graphs, Allyn and Bacon (1971).
  • [2] Fulkerson, Hoffman and McAndrew, Some Properties of Graphs with Multiple Edges, Canad. J. Math. 17 N-l. (1965), 166-177.
  • [3] S. L. Hakimi, On the Realizability of a Set of Integers as Degrees at the Vertices of a Graph, II Uniqueness, S/AM J. App. Math. (II) No. 1, (March 1963), 135-147.
  • [4] Frank Harary, Graph Theory, Addison Wesley (1969).
  • [5] R. H. Johnson, Graphical Sequences, Ph.D. Thesis, Virginia Polytechnic Institute and State University.
  • [6] J. K. Senior, Partitions and their Representative Groups, Amer. J. Math., 73 (1951), 663-689.